LeetCode: Single NumberGiven an array of integers, every element appears twice except for one. Find that single one. Note:Your algorithm should have a...
分类：
其他好文 时间：
2014-08-23 12:38:10
阅读次数：
212
被第二个条件给坑了
You are giving candies to these children subjected to the following requirements:
Each child must have at least one candy.Children with a higher rating get more candies than their ne...
分类：
其他好文 时间：
2014-08-23 11:20:30
阅读次数：
173
DescriptionHow far can you make a stack of cards overhang a table? If you have one card, you can create a maximum overhang of half a card length. (We'...
分类：
其他好文 时间：
2014-08-23 01:00:19
阅读次数：
238
LeetCode: Word BreakGiven a string s and a dictionary of words dict, determine if s can be segmented into a space-separated sequence of one or more di...
分类：
其他好文 时间：
2014-08-22 23:42:29
阅读次数：
215
判断radio是否选中并取得选中的值 One：$("input[name='items']:checked").val(); Two：function checkradio(){ var item = $(":radio:checked"); var len=item.length; if(len>...
分类：
Web程序 时间：
2014-08-22 16:01:58
阅读次数：
242
$0 ~ $4 最近选中的元素（审查元素）。$$(selector) 相当于 querySelectAll(selector)clear() 清理控制台dir(object) 输出对象的所有属性keys(obj) 输出对象的所有属性名keys({'one':1,'two':2})//["one", ...
分类：
其他好文 时间：
2014-08-22 10:40:25
阅读次数：
196
题目
描述
Long , long ago ,country A invented a missile system to destroy the missiles from their enemy . That system can launch only one missile to destroy multiple missiles if the heights of all the...
分类：
其他好文 时间：
2014-08-22 00:26:05
阅读次数：
218
DescriptionBusinesses like to have memorable telephone numbers. One way to make a telephone number memorable is to have it spell a memorable word or p...
分类：
其他好文 时间：
2014-08-22 00:19:05
阅读次数：
195
问题：Given two words (start and end), and a dictionary, find the length of shortest transformation sequence from start to end, such that:Only one letter...
分类：
编程语言 时间：
2014-08-21 22:47:14
阅读次数：
184
1, LinkedListcomposed of one and one Node: [data][next].[head] ->[data][next] ->[data][next] ->[data][next] -> [null].Empty linkedList: head == null.V...
分类：
其他好文 时间：
2014-08-21 22:46:14
阅读次数：
229
