發(fā)簡(jiǎn)信
IP屬地：廣東
-
LeetCode96. Unique Binary Search Trees
一、原題 Given n, how many structurally unique BST's (binary search trees) t...
-
Sicily1005. 最大和
一、原題 從數(shù)列A[0], A[1], A[2], ..., A[N-1]中選若干個(gè)數(shù)，要求相鄰的數(shù)不能都選，也就是說(shuō)如果選了A[i], 就不能...
-
Sicily1003. 相連的1
一、原題 對(duì)于一個(gè)01矩陣A，求其中有多少片連成一片的1。每個(gè)1可以和上下左右的1相連。 請(qǐng)為下面的Solution類(lèi)實(shí)現(xiàn)解決這一問(wèn)題的函數(shù)co...
-
LeetCode343. Integer Break
一、原題 Given a positive integer n, break it into the sum of at least two p...
-
LeetCode279. Perfect Squares
一、原題 Given a positive integer n, find the least number of perfect square...
-
LeetCode122. Best Time to Buy and Sell Stock II
一、原題 Say you have an array for which the ith element is the price of a g...
-
LeetCode264. Ugly Number II
一、原題 Write a program to find the n-th ugly number. Ugly numbers are posi...
-
LeetCode198. House Robber
198. 動(dòng)態(tài)規(guī)劃：偷馬 一、原題 You are a professional robber planning to rob houses a...
-
Java運(yùn)行時(shí)數(shù)據(jù)區(qū)域Java虛擬機(jī)在執(zhí)行Java程序過(guò)程中會(huì)把內(nèi)存區(qū)域劃分為若干個(gè)不同的數(shù)據(jù)區(qū)域，這些區(qū)域各有各自的用途、創(chuàng)建和銷(xiāo)毀時(shí)間。 程序計(jì)數(shù)器 程序計(jì)數(shù)器占...