add 25 solutions

Author: 2xiao

src/.vuepress/sidebar.ts

@@ -418,6 +418,7 @@ export default sidebar({
       "0678",
       "0680",
       "0682",
+      "0689",
       "0693",
       "0695",
       "0696",
@@ -859,24 +860,48 @@ export default sidebar({
       "2073",
       "2078",
       "2085",
+      "2089",
+      "2094",
       "2095",
-      "2097"
+      "2097",
+      "2099"
     ]
   },
   {
     "text": "2100-2199",
     "collapsible": true,
     "children": [
+      "2103",
+      "2108",
       "2109",
+      "2114",
+      "2119",
+      "2124",
+      "2129",
       "2130",
+      "2133",
+      "2138",
+      "2144",
+      "2148",
+      "2154",
+      "2160",
+      "2164",
+      "2169",
+      "2176",
+      "2180",
       "2182",
+      "2185",
+      "2190",
+      "2194",
       "2196"
     ]
   },
   {
     "text": "2200-2299",
     "collapsible": true,
     "children": [
+      "2200",
+      "2206",
       "2215",
       "2220",
       "2257",

src/plan/contest_list.md

@@ -98,7 +98,7 @@ var twoSum = function (nums, target) {
 | 1711 | 大餐计数 |  |  [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) | 🟠 | [🀄️](https://leetcode.cn/problems/count-good-meals) [🔗](https://leetcode.com/problems/count-good-meals) |
 | 2006 | 差的绝对值为 K 的数对数目 | [[✓]](/problem/2006.md) |  [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) [`计数`](/tag/counting.md) | 🟢 | [🀄️](https://leetcode.cn/problems/count-number-of-pairs-with-absolute-difference-k) [🔗](https://leetcode.com/problems/count-number-of-pairs-with-absolute-difference-k) |
 | 2023 | 连接后等于目标字符串的字符串对 |  |  [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) [`字符串`](/tag/string.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/number-of-pairs-of-strings-with-concatenation-equal-to-target) [🔗](https://leetcode.com/problems/number-of-pairs-of-strings-with-concatenation-equal-to-target) |
-| 2200 | 找出数组中的所有 K 近邻下标 |  |  [`数组`](/tag/array.md) [`双指针`](/tag/two-pointers.md) | 🟢 | [🀄️](https://leetcode.cn/problems/find-all-k-distant-indices-in-an-array) [🔗](https://leetcode.com/problems/find-all-k-distant-indices-in-an-array) |
+| 2200 | 找出数组中的所有 K 近邻下标 | [[✓]](/problem/2200.md) |  [`数组`](/tag/array.md) [`双指针`](/tag/two-pointers.md) | 🟢 | [🀄️](https://leetcode.cn/problems/find-all-k-distant-indices-in-an-array) [🔗](https://leetcode.com/problems/find-all-k-distant-indices-in-an-array) |
 | 2351 | 第一个出现两次的字母 |  |  [`位运算`](/tag/bit-manipulation.md) [`哈希表`](/tag/hash-table.md) [`字符串`](/tag/string.md) `1+` | 🟢 | [🀄️](https://leetcode.cn/problems/first-letter-to-appear-twice) [🔗](https://leetcode.com/problems/first-letter-to-appear-twice) |
 | 2354 | 优质数对的数目 |  |  [`位运算`](/tag/bit-manipulation.md) [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) `1+` | 🔴 | [🀄️](https://leetcode.cn/problems/number-of-excellent-pairs) [🔗](https://leetcode.com/problems/number-of-excellent-pairs) |
 | 2367 | 等差三元组的数目 |  |  [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) [`双指针`](/tag/two-pointers.md) `1+` | 🟢 | [🀄️](https://leetcode.cn/problems/number-of-arithmetic-triplets) [🔗](https://leetcode.com/problems/number-of-arithmetic-triplets) |

src/problem/0001.md

@@ -108,5 +108,5 @@ var reverse = function (x) {
 | :------: | :------ | :------: | :------ | :------: | :------: |
 | 8 | 字符串转换整数 (atoi) | [[✓]](/problem/0008.md) |  [`字符串`](/tag/string.md) | 🟠 | [🀄️](https://leetcode.cn/problems/string-to-integer-atoi) [🔗](https://leetcode.com/problems/string-to-integer-atoi) |
 | 190 | 颠倒二进制位 | [[✓]](/problem/0190.md) |  [`位运算`](/tag/bit-manipulation.md) [`分治`](/tag/divide-and-conquer.md) | 🟢 | [🀄️](https://leetcode.cn/problems/reverse-bits) [🔗](https://leetcode.com/problems/reverse-bits) |
-| 2119 | 反转两次的数字 |  |  [`数学`](/tag/math.md) | 🟢 | [🀄️](https://leetcode.cn/problems/a-number-after-a-double-reversal) [🔗](https://leetcode.com/problems/a-number-after-a-double-reversal) |
+| 2119 | 反转两次的数字 | [[✓]](/problem/2119.md) |  [`数学`](/tag/math.md) | 🟢 | [🀄️](https://leetcode.cn/problems/a-number-after-a-double-reversal) [🔗](https://leetcode.com/problems/a-number-after-a-double-reversal) |
 | 2442 | 反转之后不同整数的数目 |  |  [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) [`数学`](/tag/math.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/count-number-of-distinct-integers-after-reverse-operations) [🔗](https://leetcode.com/problems/count-number-of-distinct-integers-after-reverse-operations) |

src/problem/0007.md

@@ -142,4 +142,4 @@ var searchRange = function (nums, target) {
 | :------: | :------ | :------: | :------ | :------: | :------: |
 | 278 | 第一个错误的版本 | [[✓]](/problem/0278.md) |  [`二分查找`](/tag/binary-search.md) [`交互`](/tag/interactive.md) | 🟢 | [🀄️](https://leetcode.cn/problems/first-bad-version) [🔗](https://leetcode.com/problems/first-bad-version) |
 | 2055 | 蜡烛之间的盘子 |  |  [`数组`](/tag/array.md) [`字符串`](/tag/string.md) [`二分查找`](/tag/binary-search.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/plates-between-candles) [🔗](https://leetcode.com/problems/plates-between-candles) |
-| 2089 | 找出数组排序后的目标下标 |  |  [`数组`](/tag/array.md) [`二分查找`](/tag/binary-search.md) [`排序`](/tag/sorting.md) | 🟢 | [🀄️](https://leetcode.cn/problems/find-target-indices-after-sorting-array) [🔗](https://leetcode.com/problems/find-target-indices-after-sorting-array) |
+| 2089 | 找出数组排序后的目标下标 | [[✓]](/problem/2089.md) |  [`数组`](/tag/array.md) [`二分查找`](/tag/binary-search.md) [`排序`](/tag/sorting.md) | 🟢 | [🀄️](https://leetcode.cn/problems/find-target-indices-after-sorting-array) [🔗](https://leetcode.com/problems/find-target-indices-after-sorting-array) |

src/problem/0034.md

@@ -159,4 +159,4 @@ var isValidSudoku = function (board) {
 | 题号 | 标题 | 题解 | 标签 | 难度 | 力扣 |
 | :------: | :------ | :------: | :------ | :------: | :------: |
 | 37 | 解数独 | [[✓]](/problem/0037.md) |  [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) [`回溯`](/tag/backtracking.md) `1+` | 🔴 | [🀄️](https://leetcode.cn/problems/sudoku-solver) [🔗](https://leetcode.com/problems/sudoku-solver) |
-| 2133 | 检查是否每一行每一列都包含全部整数 |  |  [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) [`矩阵`](/tag/matrix.md) | 🟢 | [🀄️](https://leetcode.cn/problems/check-if-every-row-and-column-contains-all-numbers) [🔗](https://leetcode.com/problems/check-if-every-row-and-column-contains-all-numbers) |
+| 2133 | 检查是否每一行每一列都包含全部整数 | [[✓]](/problem/2133.md) |  [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) [`矩阵`](/tag/matrix.md) | 🟢 | [🀄️](https://leetcode.cn/problems/check-if-every-row-and-column-contains-all-numbers) [🔗](https://leetcode.com/problems/check-if-every-row-and-column-contains-all-numbers) |

src/problem/0036.md

@@ -192,5 +192,5 @@ var mergeWords = function (words, space) {
 | 题号 | 标题 | 题解 | 标签 | 难度 | 力扣 |
 | :------: | :------ | :------: | :------ | :------: | :------: |
 | 1592 | 重新排列单词间的空格 | [[✓]](/problem/1592.md) |  [`字符串`](/tag/string.md) | 🟢 | [🀄️](https://leetcode.cn/problems/rearrange-spaces-between-words) [🔗](https://leetcode.com/problems/rearrange-spaces-between-words) |
-| 2138 | 将字符串拆分为若干长度为 k 的组 |  |  [`字符串`](/tag/string.md) [`模拟`](/tag/simulation.md) | 🟢 | [🀄️](https://leetcode.cn/problems/divide-a-string-into-groups-of-size-k) [🔗](https://leetcode.com/problems/divide-a-string-into-groups-of-size-k) |
+| 2138 | 将字符串拆分为若干长度为 k 的组 | [[✓]](/problem/2138.md) |  [`字符串`](/tag/string.md) [`模拟`](/tag/simulation.md) | 🟢 | [🀄️](https://leetcode.cn/problems/divide-a-string-into-groups-of-size-k) [🔗](https://leetcode.com/problems/divide-a-string-into-groups-of-size-k) |
 | 2468 | 根据限制分割消息 |  |  [`字符串`](/tag/string.md) [`二分查找`](/tag/binary-search.md) | 🔴 | [🀄️](https://leetcode.cn/problems/split-message-based-on-limit) [🔗](https://leetcode.com/problems/split-message-based-on-limit) |

src/problem/0068.md

@@ -222,6 +222,6 @@ var maxProfit = function (prices) {
 | 121 | 买卖股票的最佳时机 | [[✓]](/problem/0121.md) |  [`数组`](/tag/array.md) [`动态规划`](/tag/dynamic-programming.md) | 🟢 | [🀄️](https://leetcode.cn/problems/best-time-to-buy-and-sell-stock) [🔗](https://leetcode.com/problems/best-time-to-buy-and-sell-stock) |
 | 122 | 买卖股票的最佳时机 II | [[✓]](/problem/0122.md) |  [`贪心`](/tag/greedy.md) [`数组`](/tag/array.md) [`动态规划`](/tag/dynamic-programming.md) | 🟠 | [🀄️](https://leetcode.cn/problems/best-time-to-buy-and-sell-stock-ii) [🔗](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii) |
 | 188 | 买卖股票的最佳时机 IV | [[✓]](/problem/0188.md) |  [`数组`](/tag/array.md) [`动态规划`](/tag/dynamic-programming.md) | 🔴 | [🀄️](https://leetcode.cn/problems/best-time-to-buy-and-sell-stock-iv) [🔗](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iv) |
-| 689 | 三个无重叠子数组的最大和 |  |  [`数组`](/tag/array.md) [`动态规划`](/tag/dynamic-programming.md) | 🔴 | [🀄️](https://leetcode.cn/problems/maximum-sum-of-3-non-overlapping-subarrays) [🔗](https://leetcode.com/problems/maximum-sum-of-3-non-overlapping-subarrays) |
+| 689 | 三个无重叠子数组的最大和 | [[✓]](/problem/0689.md) |  [`数组`](/tag/array.md) [`动态规划`](/tag/dynamic-programming.md) | 🔴 | [🀄️](https://leetcode.cn/problems/maximum-sum-of-3-non-overlapping-subarrays) [🔗](https://leetcode.com/problems/maximum-sum-of-3-non-overlapping-subarrays) |
 | 2291 | 最大股票收益 🔒 |  |  [`数组`](/tag/array.md) [`动态规划`](/tag/dynamic-programming.md) | 🟠 | [🀄️](https://leetcode.cn/problems/maximum-profit-from-trading-stocks) [🔗](https://leetcode.com/problems/maximum-profit-from-trading-stocks) |
 | 2555 | 两个线段获得的最多奖品 |  |  [`数组`](/tag/array.md) [`二分查找`](/tag/binary-search.md) [`滑动窗口`](/tag/sliding-window.md) | 🟠 | [🀄️](https://leetcode.cn/problems/maximize-win-from-two-segments) [🔗](https://leetcode.com/problems/maximize-win-from-two-segments) |

src/problem/0123.md

@@ -135,6 +135,6 @@ var isChar = function (i) {
 | 234 | 回文链表 | [[✓]](/problem/0234.md) |  [`栈`](/tag/stack.md) [`递归`](/tag/recursion.md) [`链表`](/tag/linked-list.md) `1+` | 🟢 | [🀄️](https://leetcode.cn/problems/palindrome-linked-list) [🔗](https://leetcode.com/problems/palindrome-linked-list) |
 | 680 | 验证回文串 II | [[✓]](/problem/0680.md) |  [`贪心`](/tag/greedy.md) [`双指针`](/tag/two-pointers.md) [`字符串`](/tag/string.md) | 🟢 | [🀄️](https://leetcode.cn/problems/valid-palindrome-ii) [🔗](https://leetcode.com/problems/valid-palindrome-ii) |
 | 2002 | 两个回文子序列长度的最大乘积 |  |  [`位运算`](/tag/bit-manipulation.md) [`字符串`](/tag/string.md) [`动态规划`](/tag/dynamic-programming.md) `2+` | 🟠 | [🀄️](https://leetcode.cn/problems/maximum-product-of-the-length-of-two-palindromic-subsequences) [🔗](https://leetcode.com/problems/maximum-product-of-the-length-of-two-palindromic-subsequences) |
-| 2108 | 找出数组中的第一个回文字符串 |  |  [`数组`](/tag/array.md) [`双指针`](/tag/two-pointers.md) [`字符串`](/tag/string.md) | 🟢 | [🀄️](https://leetcode.cn/problems/find-first-palindromic-string-in-the-array) [🔗](https://leetcode.com/problems/find-first-palindromic-string-in-the-array) |
+| 2108 | 找出数组中的第一个回文字符串 | [[✓]](/problem/2108.md) |  [`数组`](/tag/array.md) [`双指针`](/tag/two-pointers.md) [`字符串`](/tag/string.md) | 🟢 | [🀄️](https://leetcode.cn/problems/find-first-palindromic-string-in-the-array) [🔗](https://leetcode.com/problems/find-first-palindromic-string-in-the-array) |
 | 2330 | 验证回文串 IV 🔒 |  |  [`双指针`](/tag/two-pointers.md) [`字符串`](/tag/string.md) | 🟠 | [🀄️](https://leetcode.cn/problems/valid-palindrome-iv) [🔗](https://leetcode.com/problems/valid-palindrome-iv) |
 | 3035 | 回文字符串的最大数量 |  |  [`贪心`](/tag/greedy.md) [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) `3+` | 🟠 | [🀄️](https://leetcode.cn/problems/maximum-palindromes-after-operations) [🔗](https://leetcode.com/problems/maximum-palindromes-after-operations) |

src/problem/0125.md

@@ -142,4 +142,4 @@ var convertToTitle = function (columnNumber) {
 | 题号 | 标题 | 题解 | 标签 | 难度 | 力扣 |
 | :------: | :------ | :------: | :------ | :------: | :------: |
 | 171 | Excel 表列序号 | [[✓]](/problem/0171.md) |  [`数学`](/tag/math.md) [`字符串`](/tag/string.md) | 🟢 | [🀄️](https://leetcode.cn/problems/excel-sheet-column-number) [🔗](https://leetcode.com/problems/excel-sheet-column-number) |
-| 2194 | Excel 表中某个范围内的单元格 |  |  [`字符串`](/tag/string.md) | 🟢 | [🀄️](https://leetcode.cn/problems/cells-in-a-range-on-an-excel-sheet) [🔗](https://leetcode.com/problems/cells-in-a-range-on-an-excel-sheet) |
+| 2194 | Excel 表中某个范围内的单元格 | [[✓]](/problem/2194.md) |  [`字符串`](/tag/string.md) | 🟢 | [🀄️](https://leetcode.cn/problems/cells-in-a-range-on-an-excel-sheet) [🔗](https://leetcode.com/problems/cells-in-a-range-on-an-excel-sheet) |

src/problem/0168.md

@@ -130,4 +130,4 @@ var titleToNumber = function (columnTitle) {
 | 题号 | 标题 | 题解 | 标签 | 难度 | 力扣 |
 | :------: | :------ | :------: | :------ | :------: | :------: |
 | 168 | Excel 表列名称 | [[✓]](/problem/0168.md) |  [`数学`](/tag/math.md) [`字符串`](/tag/string.md) | 🟢 | [🀄️](https://leetcode.cn/problems/excel-sheet-column-title) [🔗](https://leetcode.com/problems/excel-sheet-column-title) |
-| 2194 | Excel 表中某个范围内的单元格 |  |  [`字符串`](/tag/string.md) | 🟢 | [🀄️](https://leetcode.cn/problems/cells-in-a-range-on-an-excel-sheet) [🔗](https://leetcode.com/problems/cells-in-a-range-on-an-excel-sheet) |
+| 2194 | Excel 表中某个范围内的单元格 | [[✓]](/problem/2194.md) |  [`字符串`](/tag/string.md) | 🟢 | [🀄️](https://leetcode.cn/problems/cells-in-a-range-on-an-excel-sheet) [🔗](https://leetcode.com/problems/cells-in-a-range-on-an-excel-sheet) |

src/problem/0171.md

@@ -119,4 +119,4 @@ var reverseBits = function (n) {
 | :------: | :------ | :------: | :------ | :------: | :------: |
 | 7 | 整数反转 | [[✓]](/problem/0007.md) |  [`数学`](/tag/math.md) | 🟠 | [🀄️](https://leetcode.cn/problems/reverse-integer) [🔗](https://leetcode.com/problems/reverse-integer) |
 | 191 | 位1的个数 | [[✓]](/problem/0191.md) |  [`位运算`](/tag/bit-manipulation.md) [`分治`](/tag/divide-and-conquer.md) | 🟢 | [🀄️](https://leetcode.cn/problems/number-of-1-bits) [🔗](https://leetcode.com/problems/number-of-1-bits) |
-| 2119 | 反转两次的数字 |  |  [`数学`](/tag/math.md) | 🟢 | [🀄️](https://leetcode.cn/problems/a-number-after-a-double-reversal) [🔗](https://leetcode.com/problems/a-number-after-a-double-reversal) |
+| 2119 | 反转两次的数字 | [[✓]](/problem/2119.md) |  [`数学`](/tag/math.md) | 🟢 | [🀄️](https://leetcode.cn/problems/a-number-after-a-double-reversal) [🔗](https://leetcode.com/problems/a-number-after-a-double-reversal) |

src/problem/0190.md

@@ -191,5 +191,5 @@ var findKthLargest = function (nums, k) {
 | 703 | 数据流中的第 K 大元素 | [[✓]](/problem/0703.md) |  [`树`](/tag/tree.md) [`设计`](/tag/design.md) [`二叉搜索树`](/tag/binary-search-tree.md) `3+` | 🟢 | [🀄️](https://leetcode.cn/problems/kth-largest-element-in-a-stream) [🔗](https://leetcode.com/problems/kth-largest-element-in-a-stream) |
 | 973 | 最接近原点的 K 个点 | [[✓]](/problem/0973.md) |  [`几何`](/tag/geometry.md) [`数组`](/tag/array.md) [`数学`](/tag/math.md) `4+` | 🟠 | [🀄️](https://leetcode.cn/problems/k-closest-points-to-origin) [🔗](https://leetcode.com/problems/k-closest-points-to-origin) |
 | 1985 | 找出数组中的第 K 大整数 |  |  [`数组`](/tag/array.md) [`字符串`](/tag/string.md) [`分治`](/tag/divide-and-conquer.md) `3+` | 🟠 | [🀄️](https://leetcode.cn/problems/find-the-kth-largest-integer-in-the-array) [🔗](https://leetcode.com/problems/find-the-kth-largest-integer-in-the-array) |
-| 2099 | 找到和最大的长度为 K 的子序列 |  |  [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) [`排序`](/tag/sorting.md) `1+` | 🟢 | [🀄️](https://leetcode.cn/problems/find-subsequence-of-length-k-with-the-largest-sum) [🔗](https://leetcode.com/problems/find-subsequence-of-length-k-with-the-largest-sum) |
+| 2099 | 找到和最大的长度为 K 的子序列 | [[✓]](/problem/2099.md) |  [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) [`排序`](/tag/sorting.md) `1+` | 🟢 | [🀄️](https://leetcode.cn/problems/find-subsequence-of-length-k-with-the-largest-sum) [🔗](https://leetcode.com/problems/find-subsequence-of-length-k-with-the-largest-sum) |
 | 2146 | 价格范围内最高排名的 K 样物品 |  |  [`广度优先搜索`](/tag/breadth-first-search.md) [`数组`](/tag/array.md) [`矩阵`](/tag/matrix.md) `2+` | 🟠 | [🀄️](https://leetcode.cn/problems/k-highest-ranked-items-within-a-price-range) [🔗](https://leetcode.com/problems/k-highest-ranked-items-within-a-price-range) |