题目链接Kundu is true tree lover. Tree is a connected graph havingNvertices andN-1edges. Today when he got a tree, he colored each edge with one of either...
分类：
其他好文 时间：
2014-08-23 22:55:51
阅读次数：
309
Given a stringS, find the longest palindromic substring inS. You may assume that the maximum length ofSis 1000, and there exists one unique longest pa...
分类：
其他好文 时间：
2014-08-23 21:35:21
阅读次数：
264
1,One,Euc,Ostack 虚拟磁盘镜像制作方法[Windows,Linux,类linux OS](1,基于ios部署系统生成img,2基于vm xml定义部署系统生成img qcow2) 如需提高帮助:TEL: 150 5519 8367,提高基于One,OStack的私有云搭建(能力有限....
分类：
其他好文 时间：
2014-08-23 21:33:11
阅读次数：
207
Description
A tree is a well-known data structure that is either empty (null, void, nothing) or is a set of one or more nodes connected by directed edges between nodes satisfying the following proper...
分类：
其他好文 时间：
2014-08-23 17:46:41
阅读次数：
218
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
