We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 709bd6f commit 3d7dbf9Copy full SHA for 3d7dbf9
src/class044/Code01_TrieTree.java
@@ -2,7 +2,7 @@
2
3
import java.util.HashMap;
4
5
-// 用类描述实现前缀树
+// 用类描述实现前缀树。不推荐!
6
// 测试链接 : https://leetcode.cn/problems/implement-trie-ii-prefix-tree/
7
public class Code01_TrieTree {
8
src/class044/Code02_TrieTree.java
@@ -1,6 +1,6 @@
1
package class044;
-// 用固定数组实现前缀树,空间使用是静态的
+// 用固定数组实现前缀树,空间使用是静态的。推荐!
// 测试链接 : https://www.nowcoder.com/practice/7f8a8553ddbf4eaab749ec988726702b
// 请同学们务必参考如下代码中关于输入、输出的处理
// 这是输入输出处理效率很高的写法
0 commit comments