題目

https://leetcode.com/problems/longest-word-in-dictionary/

題解

建立一個 Trie，在 insert 的過程中，除最后一個節(jié)點外，如果一路上每一個節(jié)點都 isEnd，則將其返回值 diff 設(shè)置為 false，表明它的差異可以被容忍，可參與最后的長度比較。

class Node {Node[] map;boolean isEnd;public Node() {this.map = new Node['z' - 'a' + 1];}public Node get(char c) {return map[c - 'a'];}public Node put(char c) {Node node = new Node();map[c - 'a'] = node;return node;} }class Trie {Node node;public Trie() {node = new Node();}public boolean insert(String word) {char[] chars = word.toCharArray();Node cur = node;boolean diff = false;for (int i = 0; i < chars.length; i++) {if (cur.get(chars[i]) != null) {cur = cur.get(chars[i]);if (!cur.isEnd) diff = true;} else {cur = cur.put(chars[i]);if (i != word.length() - 1) diff = true;}if (i == chars.length - 1) cur.isEnd = true;}return diff;} }class Solution {public String longestWord(String[] words) {Arrays.sort(words);Trie trie = new Trie();String result = "";for (String word : words) {if (!trie.insert(word)) result = word.length() > result.length() ? word : result;}return result;} }

總結(jié)

以上是生活随笔為你收集整理的leetcode 720. Longest Word in Dictionary | 720. 词典中最长的单词（Trie前缀树）的全部內(nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯，歡迎將生活随笔推薦給好友。