码迷,mamicode.com
首页 >  
搜索关键字:number of islands    ( 27069个结果
Leetcode: 3Sum Closest
Given an array S of n integers, find three integers in S such that the sum is closest to a given number, target. Return the sum of the three integers....
分类:其他好文   时间:2014-10-09 14:04:23    阅读次数:155
Javascript 你不知道的事,好吧,是我不知道的事
NaN表示一个不能产生正常结果的运算结果。它不等于任何值,包括它自己。可以用isNaN(number)来检测。同Java中的字符串一样,JS中的字符串是不可变的。也就是说一旦字符串被创建,就无法改变。下标表达式(如s[3],代替s.charAt(3))可以读取字符,但是不能用于改变字符。null,u...
分类:编程语言   时间:2014-10-09 13:37:43    阅读次数:318
LeetCode Gray Code
The gray code is a binary numeral system where two successive values differ in only one bit.Given a non-negative integernrepresenting the total number...
分类:其他好文   时间:2014-10-09 13:16:43    阅读次数:179
Leetcode Maximum Product Subarray
Find the contiguous subarray within an array (containing at least one number) which has the largest product.For example, given the array[2,3,-2,4],the...
分类:其他好文   时间:2014-10-09 01:08:37    阅读次数:231
shell 的判断与比较
1 shell 的$! ,$?, $$,$@$n $1 the first parameter,$2 the second...$# The number of command-line parameters.$0 The name of current program.$? ...
分类:其他好文   时间:2014-10-09 01:07:27    阅读次数:266
Maximum Subarray (JAVA)
Find the contiguous subarray within an array (containing at least one number) which has the largest sum.For example, given the array[?2,1,?3,4,?1,2,1,...
分类:编程语言   时间:2014-10-09 00:23:07    阅读次数:218
[LeetCode]Maximum Subarray
Find the contiguous subarray within an array (containing at least one number) which has the largest sum. For example, given the array [?2,1,?3,4,?1,2,1,?5,4], the contiguous subarray [4,?1,2,1] ha...
分类:其他好文   时间:2014-10-08 18:06:55    阅读次数:163
认知心理学论文精选Cognitive Psychology
1.The Magical Number Seven, Plus or MinusTwo: Some Limits on Our Capacity forProcessing InformationGeorge A Miller,1956信息加工的同时处理能力是5-9条。
分类:其他好文   时间:2014-10-08 16:12:45    阅读次数:211
Thinkphp 统计数据库字段总值
统计表中字段数据总值:$startInfo = $objOrderInfo->field("COUNT(*) number,SUM(order_amount) account")->where("ctime >='$startPeriod[startTime]' AND ctime find();
分类:数据库   时间:2014-10-08 14:26:25    阅读次数:355
Leetcode: Edit Distance
Given two words word1 and word2, find the minimum number of steps required to convert word1 to word2. (each operation is counted as 1 step.)You have t...
分类:其他好文   时间:2014-10-08 07:40:24    阅读次数:228
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!