
算法-字典树
文章平均质量分 60
BrcLi
这个作者很懒,什么都没留下…
展开
-
LeetCode 648. Replace Words 字典树练习
In English, we have a concept called root, which can be followed by some other words to form another longer word - let's call this word successor. For example, the root an, followed by other, whic原创 2017-08-15 11:23:42 · 1042 阅读 · 0 评论 -
字典树的应用:求数组中异或最大的两个数
求数组中异或最大的两个数,题目参考LeetCode:https://leetcode.com/problems/maximum-xor-of-two-numbers-in-an-array/description/hdoj :http://acm.hdu.edu.cn/showproblem.php?pid=4825最暴力也最容易想到的是遍历数组中每一个数,计算与其他数的异或,原创 2017-08-15 11:53:46 · 867 阅读 · 0 评论