Backups/CS-Notes
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

auto commit

Browse Source
This commit is contained in:
CyC2018
2019-12-06 01:04:29 +08:00
parent 26c914a662
commit 9d5a28cdc0
224 changed files with 1040 additions and 1040 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
docs/notes/Leetcode 题解 - 树.md
View File

@ -1045,7 +1045,7 @@ private void inOrder(TreeNode node, List<Integer> nums) {
# Trie
<div align="center"> <img src="pics/5c638d59-d4ae-4ba4-ad44-80bdc30f38dd.jpg"/> </div><br>
<div align="center"> <img src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/5c638d59-d4ae-4ba4-ad44-80bdc30f38dd.jpg"/> </div><br>
Trie，又称前缀树或字典树，用于判断字符串是否存在或者是否具有某种字符串前缀。