@@ -75,7 +75,7 @@ leetcode 题解，记录自己的 leetcode 解题之路。
7575
7676####简单难度
7777
78- - 🖊[[ 20. Valid Parentheses] ( ./problems/20.validParentheses.md )
78+ - 🖊[ 20. Valid Parentheses] ( ./problems/20.validParentheses.md )
7979- [ 26.remove-duplicates-from-sorted-array] ( ./problems/26.remove-duplicates-from-sorted-array.md )
8080- 🆕[ 88.merge-sorted-array] ( ./problems/88.merge-sorted-array.md )
8181- [ 136.single-number] ( ./problems/136.single-number.md )
@@ -114,7 +114,7 @@ leetcode 题解，记录自己的 leetcode 解题之路。
114114- [ 103.binary-tree-zigzag-level-order-traversal] ( ./problems/103.binary-tree-zigzag-level-order-traversal.md )
115115- [ 139.word-break] ( ./problems/139.word-breakmd )
116116- [ 144.binary-tree-preorder-traversal] ( ./problems/144.binary-tree-preorder-traversal.md )
117- - 🖊[[ 150.evaluate-reverse-polish-notation] ( ./problems/150.evaluate-reverse-polish-notation.md )
117+ - 🖊[ 150.evaluate-reverse-polish-notation] ( ./problems/150.evaluate-reverse-polish-notation.md )
118118- [ 199.binary-tree-right-side-view] ( ./problems/199.binary-tree-right-side-view.md )
119119- [ 201.bitwise-and-of-numbers-range] ( ./problems/201.bitwise-and-of-numbers-range.md )
120120- 🆕[ 208.implement-trie-prefix-tree] ( ./problems/208.implement-trie-prefix-tree.md )
@@ -143,7 +143,7 @@ leetcode 题解，记录自己的 leetcode 解题之路。
143143###数据结构与算法的总结
144144
145145- 🖊[ 数据结构] ( ./thinkings/basic-data-structure.md ) （草稿）
146- - 🖊[[ 二叉树的遍历] ( ./thinkings/binary-tree-traversal.md )
146+ - 🖊[ 二叉树的遍历] ( ./thinkings/binary-tree-traversal.md )
147147- [ 动态规划] ( ./thinkings/dynamic-programming.md )
148148- [ 哈夫曼编码和游程编码] ( ./thinkings/run-length-encode-and-huffman-encode.md )
149149- [ 布隆过滤器] ( ./thinkings/bloom-filter.md )
