LeetCode
文章平均质量分 81
weijiechenlun133
这个作者很懒,什么都没留下…
展开
-
LeetCode1-TwoSum
TwoSum原创 2017-04-11 18:07:04 · 171 阅读 · 0 评论 -
数组中两个数异或求最大值
特别说明:本文转载自lingen1949 大神的文章,按照个人理解增加了部分注释,感谢大神提供思路。在此附上原文链接:http://blog.csdn.net/lingen1949/article/details/52873656题目要求:421. Maximum XOR of Two Numbers in an ArrayGiven a non-e转载 2017-04-11 21:25:18 · 4648 阅读 · 0 评论 -
利用tire tree 寻找是否存在某个数是另外一个数的前缀(Phone List)
题目要求:描述Given a list of phone numbers, determine if it is consistent in the sense that no number is the prefix of another. Let's say the phone catalogue listed these numbers:Emergency 9原创 2017-04-12 14:17:36 · 304 阅读 · 0 评论 -
129. Sum Root to Leaf Numbers
129. Sum Root to Leaf NumbersGiven 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 represen原创 2017-04-15 22:49:02 · 153 阅读 · 0 评论