主题如以下:People in Mars represent the colors in their computers in a similar way as the Earth people. That is, a color is represented by a 6-digit number...
分类:
其他好文 时间:
2015-09-11 22:13:24
阅读次数:
238
Problem DescriptionOO has got a array A of size n ,defined a function f(l,r) represent the number of i (li) satisfy ai mod aj=0,now OO want to know∑i=...
分类:
其他好文 时间:
2015-09-10 23:48:59
阅读次数:
318
Given a digit string, return all possible letter combinations that the number could represent.A mapping of digit to letters (just like on the telephon...
分类:
其他好文 时间:
2015-09-10 16:05:38
阅读次数:
211
Given a binary tree containing digits from 0-9 only, each root-to-leaf path could represent a number.An example is the root-to-leaf path 1->2->3 which...
分类:
其他好文 时间:
2015-09-06 21:21:23
阅读次数:
131
组合模式 Composite Pattern 合成模式compose objects into tree structures to represent part-whole hierarchies.Composite lets clients treat individual objects and compositions of objects uniformly.将对象组合成树形结构以表示“部...
分类:
编程语言 时间:
2015-08-31 23:48:06
阅读次数:
308
1027. Colors in Mars (20)时间限制400 ms内存限制65536 kB代码长度限制16000 B判题程序Standard作者CHEN, YuePeople in Mars represent the colors in their computers in a similar...
分类:
其他好文 时间:
2015-08-28 21:11:26
阅读次数:
132
题目:Given a binary tree containing digits from0-9only, each root-to-leaf path could represent a number.An example is the root-to-leaf path1->2->3which ...
分类:
其他好文 时间:
2015-08-28 12:45:15
阅读次数:
125
OverviewNSURLRequestobjects represent a URL load request in a manner independent of protocol and URL scheme.NSURLRequest encapsulates two basic data e...
分类:
Web程序 时间:
2015-08-19 16:27:30
阅读次数:
224
129 Sum Root to Leaf Numbers链接:https://leetcode.com/problems/sum-root-to-leaf-numbers/
问题描述:
Given a binary tree containing digits from 0-9 only, each root-to-leaf path could represent a number.An...
分类:
其他好文 时间:
2015-08-19 07:08:42
阅读次数:
176
要讲反射,我们必须要弄清楚ClassObject,因为反射提供的方法都是ClassObject提供的。下面是java.lang.Class的类注释: Instances of the class Class represent classes and interfaces in a running....
分类:
编程语言 时间:
2015-08-19 00:21:54
阅读次数:
128