leecodecode【面试150】【2026.7.3打卡-java版本】
实现 Trie (前缀树)
要点:26叉树
class Trie {//26叉树private static class Node{Node[] son new Node[26];boolean end false;}private final Node root new Node();public Trie() {}public void insert(String word) {Node cur root;for(char c : word.toC…
2026/7/5 13:20:49