update readme

Author: lxlxw

_sidebar.md

@@ -20,7 +20,7 @@
 |  [219](https://leetcode-cn.com/problems/contains-duplicate-ii)  |  [存在重复元素 ii](/solution/200-299/0219.contains-duplicate-ii/)  |  `数组`,`哈希表`  |  <font color=green>简单</font>  |✅ |
 |  [268](https://leetcode-cn.com/problems/missing-number)  |  [缺失数字](/solution/200-299/0268.missing-number/)  |  `位运算`,`数组`,`数学`  |  <font color=green>简单</font>  |✅ |
 |  [283](https://leetcode-cn.com/problems/move-zeroes)  |  [移动零](/solution/200-299/0283.move-zeroes/)  |  `数组`,`双指针`  |  <font color=green>简单</font>  |✅ |
-
+|  [414](https://leetcode-cn.com/problems/third-maximum-number)  |  [第三大的数](/solution/400-499/0414.third-maximum-number/)  |  `数组`  |  <font color=green>简单</font>  |✅ |
 
 #### **字符串**
 

index-tags.md

@@ -119,7 +119,7 @@
 |  [408](https://leetcode-cn.com/problems/valid-word-abbreviation)  |  [有效单词缩写](/solution/400-499/0408.valid-word-abbreviation/)  |  `字符串`  |  <font color=green>简单</font>  |
 |  [409](https://leetcode-cn.com/problems/longest-palindrome)  |  [最长回文串](/solution/400-499/0409.longest-palindrome/)  |  `哈希表`  |  <font color=green>简单</font>  |
 |  [412](https://leetcode-cn.com/problems/fizz-buzz)  |  [fizz buzz](/solution/400-499/0412.fizz-buzz/)  |    |  <font color=green>简单</font>  |
-|  [414](https://leetcode-cn.com/problems/third-maximum-number)  |  [第三大的数](/solution/400-499/0414.third-maximum-number/)  |  `数组`  |  <font color=green>简单</font>  |
+|  [414](https://leetcode-cn.com/problems/third-maximum-number)  |  [第三大的数](/solution/400-499/0414.third-maximum-number/)  |  `数组`  |  <font color=green>简单</font>  |✅ |
 |  [415](https://leetcode-cn.com/problems/add-strings)  |  [字符串相加](/solution/400-499/0415.add-strings/)  |  `字符串`  |  <font color=green>简单</font>  |
 |  [422](https://leetcode-cn.com/problems/valid-word-square)  |  [有效的单词方块](/solution/400-499/0422.valid-word-square/)  |    |  <font color=green>简单</font>  |
 |  [434](https://leetcode-cn.com/problems/number-of-segments-in-a-string)  |  [字符串中的单词数](/solution/400-499/0434.number-of-segments-in-a-string/)  |  `字符串`  |  <font color=green>简单</font>  |

index-type.md

@@ -0,0 +1,116 @@
+- 🏠  速览
+  - [项目介绍](README.md  "The greatest guide in the world")
+  - [快速索引](index-type.md "按照题型或难易度快速检索题目.")
+    - [- 题型难度](index-type.md)
+    - [- 题型标签](index-tags.md)
+
+- 📚  题目列表
+  - [1 - 99题](index-tags.md)
+    - [1. 两数之和 ✅](solution/1-99/0001.two-sum/)
+    - [2. 两数相加 ✅](solution/1-99/0002.add-two-numbers/)
+    - [3. 无重复字符的最长子串](solution/1-99/0003.longest-substring-without-repeating-characters/)
+    - [4. 寻找两个有序数组的中位数](solution/1-99/0004.median-of-two-sorted-arrays/)
+    - [5. 最长回文子串](solution/1-99/0005.longest-palindromic-substring/)
+    - [6. z 字形变换](solution/1-99/0006.zigzag-conversion/)
+    - [7. 整数反转 ✅](solution/1-99/0007.reverse-integer/)
+    - [8. 字符串转换整数 (atoi)](solution/1-99/0008.string-to-integer-atoi/)
+    - [9. 回文数 ✅](solution/1-99/0009.palindrome-number/)
+    - [10. 正则表达式匹配](solution/1-99/0010.regular-expression-matching/)
+    - [11. 盛最多水的容器](solution/1-99/0011.container-with-most-water/)
+    - [12. 整数转罗马数字](solution/1-99/0012.integer-to-roman/)
+    - [13. 罗马数字转整数 ✅](solution/1-99/0013.roman-to-integer/)
+    - [14. 最长公共前缀](solution/1-99/0014.longest-common-prefix/)
+    - [15. 三数之和](solution/1-99/0015.3sum/)
+    - [16. 最接近的三数之和](solution/1-99/0016.3sum-closest/)
+    - [17. 电话号码的字母组合](solution/1-99/0017.letter-combinations-of-a-phone-number/)
+    - [18. 四数之和](solution/1-99/0018.4sum/)
+    - [19. 删除链表的倒数第n个节点](solution/1-99/0019.remove-nth-node-from-end-of-list/)
+    - [20. 有效的括号 ✅](solution/1-99/0020.valid-parentheses/)
+    - [21. 合并两个有序链表 ✅](solution/1-99/0021.merge-two-sorted-lists/)
+    - [22. 括号生成](solution/1-99/0022.generate-parentheses/)
+    - [23. 合并k个排序链表](solution/1-99/0023.merge-k-sorted-lists/)
+    - [24. 两两交换链表中的节点](solution/1-99/0024.swap-nodes-in-pairs/)
+    - [25. k 个一组翻转链表](solution/1-99/0025.reverse-nodes-in-k-group/)
+    - [26. 删除排序数组中的重复项 ✅](solution/1-99/0026.remove-duplicates-from-sorted-array/)
+    - [27. 移除元素 ✅](solution/1-99/0027.remove-element/)
+    - [28. 实现 strstr() ✅](solution/1-99/0028.implement-strstr/)
+    - [29. 两数相除](solution/1-99/0029.divide-two-integers/)
+    - [30. 串联所有单词的子串](solution/1-99/0030.substring-with-concatenation-of-all-words/)
+    - [31. 下一个排列](solution/1-99/0031.next-permutation/)
+    - [32. 最长有效括号](solution/1-99/0032.longest-valid-parentheses/)
+    - [33. 搜索旋转排序数组](solution/1-99/0033.search-in-rotated-sorted-array/)
+    - [34. 在排序数组中查找元素的第一个和最后一个位置](solution/1-99/0034.find-first-and-last-position-of-element-in-sorted-array/)
+    - [35. 搜索插入位置 ✅](solution/1-99/0035.search-insert-position/)
+    - [36. 有效的数独](solution/1-99/0036.valid-sudoku/)
+    - [37. 解数独](solution/1-99/0037.sudoku-solver/)
+    - [38. 外观数列](solution/1-99/0038.count-and-say/)
+    - [39. 组合总和](solution/1-99/0039.combination-sum/)
+    - [40. 组合总和 ii](solution/1-99/0040.combination-sum-ii/)
+    - [41. 缺失的第一个正数](solution/1-99/0041.first-missing-positive/)
+    - [42. 接雨水](solution/1-99/0042.trapping-rain-water/)
+    - [43. 字符串相乘](solution/1-99/0043.multiply-strings/)
+    - [44. 通配符匹配](solution/1-99/0044.wildcard-matching/)
+    - [45. 跳跃游戏 ii](solution/1-99/0045.jump-game-ii/)
+    - [46. 全排列](solution/1-99/0046.permutations/)
+    - [47. 全排列 ii](solution/1-99/0047.permutations-ii/)
+    - [48. 旋转图像](solution/1-99/0048.rotate-image/)
+    - [49. 字母异位词分组](solution/1-99/0049.group-anagrams/)
+    - [50. pow(x, n)](solution/1-99/0050.powx-c-n/)
+    - [51. n皇后](solution/1-99/0051.n-queens/)
+    - [52. n皇后 ii](solution/1-99/0052.n-queens-ii/)
+    - [53. 最大子序和](solution/1-99/0053.maximum-subarray/)
+    - [54. 螺旋矩阵](solution/1-99/0054.spiral-matrix/)
+    - [55. 跳跃游戏](solution/1-99/0055.jump-game/)
+    - [56. 合并区间](solution/1-99/0056.merge-intervals/)
+    - [57. 插入区间](solution/1-99/0057.insert-interval/)
+    - [58. 最后一个单词的长度](solution/1-99/0058.length-of-last-word/)
+    - [59. 螺旋矩阵 ii](solution/1-99/0059.spiral-matrix-ii/)
+    - [60. 第k个排列](solution/1-99/0060.permutation-sequence/)
+    - [61. 旋转链表](solution/1-99/0061.rotate-list/)
+    - [62. 不同路径](solution/1-99/0062.unique-paths/)
+    - [63. 不同路径 ii](solution/1-99/0063.unique-paths-ii/)
+    - [64. 最小路径和](solution/1-99/0064.minimum-path-sum/)
+    - [65. 有效数字](solution/1-99/0065.valid-number/)
+    - [66. 加一 ✅](solution/1-99/0066.plus-one/)
+    - [67. 二进制求和](solution/1-99/0067.add-binary/)
+    - [68. 文本左右对齐](solution/1-99/0068.text-justification/)
+    - [69. x 的平方根](solution/1-99/0069.sqrtx/)
+    - [70. 爬楼梯](solution/1-99/0070.climbing-stairs/)
+    - [71. 简化路径](solution/1-99/0071.simplify-path/)
+    - [72. 编辑距离](solution/1-99/0072.edit-distance/)
+    - [73. 矩阵置零](solution/1-99/0073.set-matrix-zeroes/)
+    - [74. 搜索二维矩阵](solution/1-99/0074.search-a-2d-matrix/)
+    - [75. 颜色分类](solution/1-99/0075.sort-colors/)
+    - [76. 最小覆盖子串](solution/1-99/0076.minimum-window-substring/)
+    - [77. 组合](solution/1-99/0077.combinations/)
+    - [78. 子集](solution/1-99/0078.subsets/)
+    - [79. 单词搜索](solution/1-99/0079.word-search/)
+    - [80. 删除排序数组中的重复项 ii](solution/1-99/0080.remove-duplicates-from-sorted-array-ii/)
+    - [81. 搜索旋转排序数组 ii](solution/1-99/0081.search-in-rotated-sorted-array-ii/)
+    - [82. 删除排序链表中的重复元素 ii](solution/1-99/0082.remove-duplicates-from-sorted-list-ii/)
+    - [83. 删除排序链表中的重复元素 ✅](solution/1-99/0083.remove-duplicates-from-sorted-list/)
+    - [84. 柱状图中最大的矩形](solution/1-99/0084.largest-rectangle-in-histogram/)
+    - [85. 最大矩形](solution/1-99/0085.maximal-rectangle/)
+    - [86. 分隔链表](solution/1-99/0086.partition-list/)
+    - [87. 扰乱字符串](solution/1-99/0087.scramble-string/)
+    - [88. 合并两个有序数组 ✅](solution/1-99/0088.merge-sorted-array/)
+    - [89. 格雷编码](solution/1-99/0089.gray-code/)
+    - [90. 子集 ii](solution/1-99/0090.subsets-ii/)
+    - [91. 解码方法](solution/1-99/0091.decode-ways/)
+    - [92. 反转链表 ii](solution/1-99/0092.reverse-linked-list-ii/)
+    - [93. 复原ip地址](solution/1-99/0093.restore-ip-addresses/)
+    - [94. 二叉树的中序遍历](solution/1-99/0094.binary-tree-inorder-traversal/)
+    - [95. 不同的二叉搜索树 ii](solution/1-99/0095.unique-binary-search-trees-ii/)
+    - [96. 不同的二叉搜索树](solution/1-99/0096.unique-binary-search-trees/)
+    - [97. 交错字符串](solution/1-99/0097.interleaving-string/)
+    - [98. 验证二叉搜索树](solution/1-99/0098.validate-binary-search-tree/)
+    - [99. 恢复二叉搜索树](solution/1-99/0099.recover-binary-search-tree/)
+    
+    
+
+
+
+
+
+  
+

solution/1-99/_sidebar.md

@@ -0,0 +1,19 @@
+# [100. xxx](https://leetcode-cn.com/problems/recover-binary-search-tree)
+
+### 题目描述
+
+
+### 解题思路
+
+
+### 具体解法
+
+<!-- tabs:start -->
+
+#### **Golang**
+```go
+
+```
+
+<!-- tabs:end -->
+

solution/100-199/0100.same-tree/README.md

@@ -0,0 +1,19 @@
+# [100. xxx](https://leetcode-cn.com/problems/recover-binary-search-tree)
+
+### 题目描述
+
+
+### 解题思路
+
+
+### 具体解法
+
+<!-- tabs:start -->
+
+#### **Golang**
+```go
+
+```
+
+<!-- tabs:end -->
+

solution/100-199/0101.symmetric-tree/README.md

@@ -0,0 +1,19 @@
+# [100. xxx](https://leetcode-cn.com/problems/recover-binary-search-tree)
+
+### 题目描述
+
+
+### 解题思路
+
+
+### 具体解法
+
+<!-- tabs:start -->
+
+#### **Golang**
+```go
+
+```
+
+<!-- tabs:end -->
+

solution/100-199/0102.binary-tree-level-order-traversal/README.md

@@ -0,0 +1,19 @@
+# [100. xxx](https://leetcode-cn.com/problems/recover-binary-search-tree)
+
+### 题目描述
+
+
+### 解题思路
+
+
+### 具体解法
+
+<!-- tabs:start -->
+
+#### **Golang**
+```go
+
+```
+
+<!-- tabs:end -->
+

solution/100-199/0103.binary-tree-zigzag-level-order-traversal/README.md

@@ -0,0 +1,19 @@
+# [100. xxx](https://leetcode-cn.com/problems/recover-binary-search-tree)
+
+### 题目描述
+
+
+### 解题思路
+
+
+### 具体解法
+
+<!-- tabs:start -->
+
+#### **Golang**
+```go
+
+```
+
+<!-- tabs:end -->
+

solution/100-199/0104.maximum-depth-of-binary-tree/README.md

@@ -0,0 +1,19 @@
+# [100. xxx](https://leetcode-cn.com/problems/recover-binary-search-tree)
+
+### 题目描述
+
+
+### 解题思路
+
+
+### 具体解法
+
+<!-- tabs:start -->
+
+#### **Golang**
+```go
+
+```
+
+<!-- tabs:end -->
+

solution/100-199/0105.construct-binary-tree-from-preorder-and-inorder-traversal/README.md

@@ -0,0 +1,19 @@
+# [100. xxx](https://leetcode-cn.com/problems/recover-binary-search-tree)
+
+### 题目描述
+
+
+### 解题思路
+
+
+### 具体解法
+
+<!-- tabs:start -->
+
+#### **Golang**
+```go
+
+```
+
+<!-- tabs:end -->
+

solution/100-199/0106.construct-binary-tree-from-inorder-and-postorder-traversal/README.md

@@ -0,0 +1,19 @@
+# [100. xxx](https://leetcode-cn.com/problems/recover-binary-search-tree)
+
+### 题目描述
+
+
+### 解题思路
+
+
+### 具体解法
+
+<!-- tabs:start -->
+
+#### **Golang**
+```go
+
+```
+
+<!-- tabs:end -->
+

solution/100-199/0107.binary-tree-level-order-traversal-ii/README.md

@@ -0,0 +1,19 @@
+# [100. xxx](https://leetcode-cn.com/problems/recover-binary-search-tree)
+
+### 题目描述
+
+
+### 解题思路
+
+
+### 具体解法
+
+<!-- tabs:start -->
+
+#### **Golang**
+```go
+
+```
+
+<!-- tabs:end -->
+

solution/100-199/0108.convert-sorted-array-to-binary-search-tree/README.md

@@ -0,0 +1,19 @@
+# [100. xxx](https://leetcode-cn.com/problems/recover-binary-search-tree)
+
+### 题目描述
+
+
+### 解题思路
+
+
+### 具体解法
+
+<!-- tabs:start -->
+
+#### **Golang**
+```go
+
+```
+
+<!-- tabs:end -->
+

solution/100-199/0109.convert-sorted-list-to-binary-search-tree/README.md

@@ -0,0 +1,19 @@
+# [100. xxx](https://leetcode-cn.com/problems/recover-binary-search-tree)
+
+### 题目描述
+
+
+### 解题思路
+
+
+### 具体解法
+
+<!-- tabs:start -->
+
+#### **Golang**
+```go
+
+```
+
+<!-- tabs:end -->
+

solution/100-199/0110.balanced-binary-tree/README.md

@@ -0,0 +1,19 @@
+# [100. xxx](https://leetcode-cn.com/problems/recover-binary-search-tree)
+
+### 题目描述
+
+
+### 解题思路
+
+
+### 具体解法
+
+<!-- tabs:start -->
+
+#### **Golang**
+```go
+
+```
+
+<!-- tabs:end -->
+

solution/100-199/0111.minimum-depth-of-binary-tree/README.md

@@ -0,0 +1,19 @@
+# [100. xxx](https://leetcode-cn.com/problems/recover-binary-search-tree)
+
+### 题目描述
+
+
+### 解题思路
+
+
+### 具体解法
+
+<!-- tabs:start -->
+
+#### **Golang**
+```go
+
+```
+
+<!-- tabs:end -->
+