Description:
Solution:
For solving this problem, we use TrieNode (prefix tree).
In serach(), we use recursion method to check "."
if c is "." we are gonna check the values next to the "."
We put the values in dfs() from the next one, so that check recursively by increasing i.
'LeetCode ๐๏ธ > Tree' ์นดํ ๊ณ ๋ฆฌ์ ๋ค๋ฅธ ๊ธ
| 212. Word Search II (0) | 2023.06.12 |
|---|---|
| 235. Lowest Common Ancestor of a Binary Search Tree (0) | 2023.06.09 |
| 230. Kth Smallest Element in a BST (0) | 2023.06.05 |
| 297. Serialize and Deserialize Binary Tree (0) | 2023.06.04 |
| 98. Validate Binary Search Tree (0) | 2023.06.03 |
