dezhonger的专栏

Trie+递归 class WordDictionary { Trie root; /** * Initialize your data structure here. */ public WordDictionary() { root = new Trie(); } /** * Adds a wo...

求出现频率最多的k个单词 1、使用优先队列解法 public List<String> topKFrequent(String[] words, int k) { List<String> res = new ArrayList<>(); Map<String, Integer> map = new...

trie： 维护当前节点的值，当前节点对应前缀的值 public class MapSum { /** * Initialize your data structure here. */ Trie trie; public MapSum() { trie = new Trie(); } public void i...

给定一个数组，求两个数异或后的值最大是多少 sol: 注意到异或一个性质, 如果a^b=c那么 b^c=a 详细的题解看这里，https://kingsfish.github.io/2017/12/15/Leetcode-421-Maximum-XOR-of-Two-Numbers-in-an-Array/ 写的非常好 public int fin...

https://leetcode.com/problems/replace-words/ 就是要找出每个单词的最短前缀，使用Trie来做。 import java.util.List; /** * Created by dezhonger on 2019/7/17 * trie */ public class Leetcode0648 { public String rep...