2016年12月25日
421. Maximum XOR of Two Numbers in an Array——本质：利用trie数据结构查找
摘要： Given a non-empty array of numbers, a0, a1, a2, … , an-1, where 0 ≤ ai < 231. Find the maximum result of ai XOR aj, where 0 ≤ i, j < n. Could you do t 阅读全文
posted @ 2016-12-25 23:18 bonelee 阅读(377) 评论(0) 推荐(0) 编辑
337. House Robber III——树的题目几乎都是BFS、DFS，要么递归要么循环
摘要： The thief has found himself a new place for his thievery again. There is only one entrance to this area, called the "root." Besides the root, each hou 阅读全文
posted @ 2016-12-25 20:47 bonelee 阅读(319) 评论(0) 推荐(0) 编辑
454. 4Sum II ——查找本质：hash最快，二分次之
摘要： Given four lists A, B, C, D of integer values, compute how many tuples (i, j, k, l) there are such that A[i] + B[j] + C[k] + D[l] is zero. To make pro 阅读全文
posted @ 2016-12-25 18:57 bonelee 阅读(1061) 评论(0) 推荐(0) 编辑