We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 55b7251 commit dca9384Copy full SHA for dca9384
Python/word-search-ii.py
@@ -1,5 +1,5 @@
1
-# Time: O(m * n * l)
2
-# Space: O(l)
+# Time: O(m * n * 4 * 3^(h - 1)) ~= O(m * n * 3^h), h is the height of trie
+# Space: O(t), t is the number of nodes in trie
3
4
class TrieNode(object):
5
# Initialize your data structure here.
0 commit comments