add 338 435 862 901

Author: 2xiao

src/.vuepress/sidebar.ts

@@ -251,6 +251,7 @@ export default sidebar({
       "0322",
       "0328",
       "0334",
+      "0338",
       "0343",
       "0344",
       "0345",
@@ -285,6 +286,7 @@ export default sidebar({
       "0430",
       "0432",
       "0433",
+      "0435",
       "0437",
       "0438",
       "0440",
@@ -377,6 +379,7 @@ export default sidebar({
       "0844",
       "0845",
       "0852",
+      "0862",
       "0872",
       "0876",
       "0880",
@@ -387,6 +390,7 @@ export default sidebar({
     "text": "0900-0999",
     "collapsible": true,
     "children": [
+      "0901",
       "0909",
       "0918",
       "0921",
@@ -466,6 +470,7 @@ export default sidebar({
     "children": [
       "1522",
       "1545",
+      "1574",
       "1590",
       "1593"
     ]

src/book/bit.md

@@ -18,7 +18,7 @@
 | 371 | 两整数之和 |  |  [`位运算`](/tag/bit-manipulation.md) [`数学`](/tag/math.md) | 🟠 | [🀄️](https://leetcode.cn/problems/sum-of-two-integers) [🔗](https://leetcode.com/problems/sum-of-two-integers) |
 | 89 | 格雷编码 |  |  [`位运算`](/tag/bit-manipulation.md) [`数学`](/tag/math.md) [`回溯`](/tag/backtracking.md) | 🟠 | [🀄️](https://leetcode.cn/problems/gray-code) [🔗](https://leetcode.com/problems/gray-code) |
 | 201 | 数字范围按位与 | [[✓]](/problem/0201.md) |  [`位运算`](/tag/bit-manipulation.md) | 🟠 | [🀄️](https://leetcode.cn/problems/bitwise-and-of-numbers-range) [🔗](https://leetcode.com/problems/bitwise-and-of-numbers-range) |
-| 338 | 比特位计数 |  |  [`位运算`](/tag/bit-manipulation.md) [`动态规划`](/tag/dynamic-programming.md) | 🟢 | [🀄️](https://leetcode.cn/problems/counting-bits) [🔗](https://leetcode.com/problems/counting-bits) |
+| 338 | 比特位计数 | [[✓]](/problem/0338.md) |  [`位运算`](/tag/bit-manipulation.md) [`动态规划`](/tag/dynamic-programming.md) | 🟢 | [🀄️](https://leetcode.cn/problems/counting-bits) [🔗](https://leetcode.com/problems/counting-bits) |
 | 136 | 只出现一次的数字 | [[✓]](/problem/0136.md) |  [`位运算`](/tag/bit-manipulation.md) [`数组`](/tag/array.md) | 🟢 | [🀄️](https://leetcode.cn/problems/single-number) [🔗](https://leetcode.com/problems/single-number) |
 | 137 | 只出现一次的数字 II | [[✓]](/problem/0137.md) |  [`位运算`](/tag/bit-manipulation.md) [`数组`](/tag/array.md) | 🟠 | [🀄️](https://leetcode.cn/problems/single-number-ii) [🔗](https://leetcode.com/problems/single-number-ii) |
 | 260 | 只出现一次的数字 III |  |  [`位运算`](/tag/bit-manipulation.md) [`数组`](/tag/array.md) | 🟠 | [🀄️](https://leetcode.cn/problems/single-number-iii) [🔗](https://leetcode.com/problems/single-number-iii) |

src/book/dynamic_programming.md

@@ -88,7 +88,7 @@
 | 639 | 解码方法 II |  |  [`字符串`](/tag/string.md) [`动态规划`](/tag/dynamic-programming.md) | 🔴 | [🀄️](https://leetcode.cn/problems/decode-ways-ii) [🔗](https://leetcode.com/problems/decode-ways-ii) |
 | 132 | 分割回文串 II |  |  [`字符串`](/tag/string.md) [`动态规划`](/tag/dynamic-programming.md) | 🔴 | [🀄️](https://leetcode.cn/problems/palindrome-partitioning-ii) [🔗](https://leetcode.com/problems/palindrome-partitioning-ii) |
 | 1220 | 统计元音字母序列的数目 |  |  [`动态规划`](/tag/dynamic-programming.md) | 🔴 | [🀄️](https://leetcode.cn/problems/count-vowels-permutation) [🔗](https://leetcode.com/problems/count-vowels-permutation) |
-| 338 | 比特位计数 |  |  [`位运算`](/tag/bit-manipulation.md) [`动态规划`](/tag/dynamic-programming.md) | 🟢 | [🀄️](https://leetcode.cn/problems/counting-bits) [🔗](https://leetcode.com/problems/counting-bits) |
+| 338 | 比特位计数 | [[✓]](/problem/0338.md) |  [`位运算`](/tag/bit-manipulation.md) [`动态规划`](/tag/dynamic-programming.md) | 🟢 | [🀄️](https://leetcode.cn/problems/counting-bits) [🔗](https://leetcode.com/problems/counting-bits) |
 | 801 | 使序列递增的最小交换次数 |  |  [`数组`](/tag/array.md) [`动态规划`](/tag/dynamic-programming.md) | 🔴 | [🀄️](https://leetcode.cn/problems/minimum-swaps-to-make-sequences-increasing) [🔗](https://leetcode.com/problems/minimum-swaps-to-make-sequences-increasing) |
 | 871 | 最低加油次数 |  |  [`贪心`](/tag/greedy.md) [`数组`](/tag/array.md) [`动态规划`](/tag/dynamic-programming.md) `1+` | 🔴 | [🀄️](https://leetcode.cn/problems/minimum-number-of-refueling-stops) [🔗](https://leetcode.com/problems/minimum-number-of-refueling-stops) |
 | 45 | 跳跃游戏 II | [[✓]](/problem/0045.md) |  [`贪心`](/tag/greedy.md) [`数组`](/tag/array.md) [`动态规划`](/tag/dynamic-programming.md) | 🟠 | [🀄️](https://leetcode.cn/problems/jump-game-ii) [🔗](https://leetcode.com/problems/jump-game-ii) |

src/book/greedy.md

@@ -25,7 +25,7 @@
 | 455 | 分发饼干 |  |  [`贪心`](/tag/greedy.md) [`数组`](/tag/array.md) [`双指针`](/tag/two-pointers.md) `1+` | 🟢 | [🀄️](https://leetcode.cn/problems/assign-cookies) [🔗](https://leetcode.com/problems/assign-cookies) |
 | 860 | 柠檬水找零 |  |  [`贪心`](/tag/greedy.md) [`数组`](/tag/array.md) | 🟢 | [🀄️](https://leetcode.cn/problems/lemonade-change) [🔗](https://leetcode.com/problems/lemonade-change) |
 | 56 | 合并区间 | [[✓]](/problem/0056.md) |  [`数组`](/tag/array.md) [`排序`](/tag/sorting.md) | 🟠 | [🀄️](https://leetcode.cn/problems/merge-intervals) [🔗](https://leetcode.com/problems/merge-intervals) |
-| 435 | 无重叠区间 |  |  [`贪心`](/tag/greedy.md) [`数组`](/tag/array.md) [`动态规划`](/tag/dynamic-programming.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/non-overlapping-intervals) [🔗](https://leetcode.com/problems/non-overlapping-intervals) |
+| 435 | 无重叠区间 | [[✓]](/problem/0435.md) |  [`贪心`](/tag/greedy.md) [`数组`](/tag/array.md) [`动态规划`](/tag/dynamic-programming.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/non-overlapping-intervals) [🔗](https://leetcode.com/problems/non-overlapping-intervals) |
 | 452 | 用最少数量的箭引爆气球 | [[✓]](/problem/0452.md) |  [`贪心`](/tag/greedy.md) [`数组`](/tag/array.md) [`排序`](/tag/sorting.md) | 🟠 | [🀄️](https://leetcode.cn/problems/minimum-number-of-arrows-to-burst-balloons) [🔗](https://leetcode.com/problems/minimum-number-of-arrows-to-burst-balloons) |
 | 55 | 跳跃游戏 | [[✓]](/problem/0055.md) |  [`贪心`](/tag/greedy.md) [`数组`](/tag/array.md) [`动态规划`](/tag/dynamic-programming.md) | 🟠 | [🀄️](https://leetcode.cn/problems/jump-game) [🔗](https://leetcode.com/problems/jump-game) |
 | 45 | 跳跃游戏 II | [[✓]](/problem/0045.md) |  [`贪心`](/tag/greedy.md) [`数组`](/tag/array.md) [`动态规划`](/tag/dynamic-programming.md) | 🟠 | [🀄️](https://leetcode.cn/problems/jump-game-ii) [🔗](https://leetcode.com/problems/jump-game-ii) |

src/book/slide_window.md

@@ -574,7 +574,7 @@ var lengthOfLongestSubstring = function (s) {
 | 76 | 最小覆盖子串 | [[✓]](/problem/0076.md) |  [`哈希表`](/tag/hash-table.md) [`字符串`](/tag/string.md) [`滑动窗口`](/tag/sliding-window.md) | 🔴 | [🀄️](https://leetcode.cn/problems/minimum-window-substring) [🔗](https://leetcode.com/problems/minimum-window-substring) |
 | 718 | 最长重复子数组 |  |  [`数组`](/tag/array.md) [`二分查找`](/tag/binary-search.md) [`动态规划`](/tag/dynamic-programming.md) `3+` | 🟠 | [🀄️](https://leetcode.cn/problems/maximum-length-of-repeated-subarray) [🔗](https://leetcode.com/problems/maximum-length-of-repeated-subarray) |
 | 209 | 长度最小的子数组 | [[✓]](/problem/0209.md) |  [`数组`](/tag/array.md) [`二分查找`](/tag/binary-search.md) [`前缀和`](/tag/prefix-sum.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/minimum-size-subarray-sum) [🔗](https://leetcode.com/problems/minimum-size-subarray-sum) |
-| 862 | 和至少为 K 的最短子数组 |  |  [`队列`](/tag/queue.md) [`数组`](/tag/array.md) [`二分查找`](/tag/binary-search.md) `4+` | 🔴 | [🀄️](https://leetcode.cn/problems/shortest-subarray-with-sum-at-least-k) [🔗](https://leetcode.com/problems/shortest-subarray-with-sum-at-least-k) |
+| 862 | 和至少为 K 的最短子数组 | [[✓]](/problem/0862.md) |  [`队列`](/tag/queue.md) [`数组`](/tag/array.md) [`二分查找`](/tag/binary-search.md) `4+` | 🔴 | [🀄️](https://leetcode.cn/problems/shortest-subarray-with-sum-at-least-k) [🔗](https://leetcode.com/problems/shortest-subarray-with-sum-at-least-k) |
 | 1004 | 最大连续1的个数 III | [[✓]](/problem/1004.md) |  [`数组`](/tag/array.md) [`二分查找`](/tag/binary-search.md) [`前缀和`](/tag/prefix-sum.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/max-consecutive-ones-iii) [🔗](https://leetcode.com/problems/max-consecutive-ones-iii) |
 | 1658 | 将 x 减到 0 的最小操作数 |  |  [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) [`二分查找`](/tag/binary-search.md) `2+` | 🟠 | [🀄️](https://leetcode.cn/problems/minimum-operations-to-reduce-x-to-zero) [🔗](https://leetcode.com/problems/minimum-operations-to-reduce-x-to-zero) |
 | 424 | 替换后的最长重复字符 |  |  [`哈希表`](/tag/hash-table.md) [`字符串`](/tag/string.md) [`滑动窗口`](/tag/sliding-window.md) | 🟠 | [🀄️](https://leetcode.cn/problems/longest-repeating-character-replacement) [🔗](https://leetcode.com/problems/longest-repeating-character-replacement) |

src/book/stack.md

@@ -649,7 +649,7 @@ var dailyTemperatures = function (temperatures) {
 | 739 | 每日温度 | [[✓]](/problem/0739.md) |  [`栈`](/tag/stack.md) [`数组`](/tag/array.md) [`单调栈`](/tag/monotonic-stack.md) | 🟠 | [🀄️](https://leetcode.cn/problems/daily-temperatures) [🔗](https://leetcode.com/problems/daily-temperatures) |
 | 496 | 下一个更大元素 I | [[✓]](/problem/0496.md) |  [`栈`](/tag/stack.md) [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) `1+` | 🟢 | [🀄️](https://leetcode.cn/problems/next-greater-element-i) [🔗](https://leetcode.com/problems/next-greater-element-i) |
 | 503 | 下一个更大元素 II | [[✓]](/problem/0503.md) |  [`栈`](/tag/stack.md) [`数组`](/tag/array.md) [`单调栈`](/tag/monotonic-stack.md) | 🟠 | [🀄️](https://leetcode.cn/problems/next-greater-element-ii) [🔗](https://leetcode.com/problems/next-greater-element-ii) |
-| 901 | 股票价格跨度 |  |  [`栈`](/tag/stack.md) [`设计`](/tag/design.md) [`数据流`](/tag/data-stream.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/online-stock-span) [🔗](https://leetcode.com/problems/online-stock-span) |
+| 901 | 股票价格跨度 | [[✓]](/problem/0901.md) |  [`栈`](/tag/stack.md) [`设计`](/tag/design.md) [`数据流`](/tag/data-stream.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/online-stock-span) [🔗](https://leetcode.com/problems/online-stock-span) |
 | 84 | 柱状图中最大的矩形 | [[✓]](/problem/0084.md) |  [`栈`](/tag/stack.md) [`数组`](/tag/array.md) [`单调栈`](/tag/monotonic-stack.md) | 🔴 | [🀄️](https://leetcode.cn/problems/largest-rectangle-in-histogram) [🔗](https://leetcode.com/problems/largest-rectangle-in-histogram) |
 | 316 | 去除重复字母 | [[✓]](/problem/0316.md) |  [`栈`](/tag/stack.md) [`贪心`](/tag/greedy.md) [`字符串`](/tag/string.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/remove-duplicate-letters) [🔗](https://leetcode.com/problems/remove-duplicate-letters) |
 | 42 | 接雨水 | [[✓]](/problem/0042.md) |  [`栈`](/tag/stack.md) [`数组`](/tag/array.md) [`双指针`](/tag/two-pointers.md) `2+` | 🔴 | [🀄️](https://leetcode.cn/problems/trapping-rain-water) [🔗](https://leetcode.com/problems/trapping-rain-water) |

src/plan/contest_list.md

@@ -3889,7 +3889,7 @@ headerDepth: 0
 | :------: | :------ | :------: | :------ | :------ | :------: |
 | 1572 | 矩阵对角线元素的和 |  |  [`数组`](/tag/array.md) [`矩阵`](/tag/matrix.md) | 🟢 | [🀄️](https://leetcode.cn/problems/matrix-diagonal-sum) [🔗](https://leetcode.com/problems/matrix-diagonal-sum) |
 | 1573 | 分割字符串的方案数 |  |  [`数学`](/tag/math.md) [`字符串`](/tag/string.md) | 🟠 | [🀄️](https://leetcode.cn/problems/number-of-ways-to-split-a-string) [🔗](https://leetcode.com/problems/number-of-ways-to-split-a-string) |
-| 1574 | 删除最短的子数组使剩余数组有序 |  |  [`栈`](/tag/stack.md) [`数组`](/tag/array.md) [`双指针`](/tag/two-pointers.md) `2+` | 🟠 | [🀄️](https://leetcode.cn/problems/shortest-subarray-to-be-removed-to-make-array-sorted) [🔗](https://leetcode.com/problems/shortest-subarray-to-be-removed-to-make-array-sorted) |
+| 1574 | 删除最短的子数组使剩余数组有序 | [[✓]](/problem/1574.md) |  [`栈`](/tag/stack.md) [`数组`](/tag/array.md) [`双指针`](/tag/two-pointers.md) `2+` | 🟠 | [🀄️](https://leetcode.cn/problems/shortest-subarray-to-be-removed-to-make-array-sorted) [🔗](https://leetcode.com/problems/shortest-subarray-to-be-removed-to-make-array-sorted) |
 | 1575 | 统计所有可行路径 |  |  [`记忆化搜索`](/tag/memoization.md) [`数组`](/tag/array.md) [`动态规划`](/tag/dynamic-programming.md) | 🔴 | [🀄️](https://leetcode.cn/problems/count-all-possible-routes) [🔗](https://leetcode.com/problems/count-all-possible-routes) |
 
 
@@ -5532,7 +5532,7 @@ headerDepth: 0
 | 题号 | 标题 | 题解 | 标签 | 难度 | 力扣 |
 | :------: | :------ | :------: | :------ | :------ | :------: |
 | 900 | RLE 迭代器 |  |  [`设计`](/tag/design.md) [`数组`](/tag/array.md) [`计数`](/tag/counting.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/rle-iterator) [🔗](https://leetcode.com/problems/rle-iterator) |
-| 901 | 股票价格跨度 |  |  [`栈`](/tag/stack.md) [`设计`](/tag/design.md) [`数据流`](/tag/data-stream.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/online-stock-span) [🔗](https://leetcode.com/problems/online-stock-span) |
+| 901 | 股票价格跨度 | [[✓]](/problem/0901.md) |  [`栈`](/tag/stack.md) [`设计`](/tag/design.md) [`数据流`](/tag/data-stream.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/online-stock-span) [🔗](https://leetcode.com/problems/online-stock-span) |
 | 902 | 最大为 N 的数字组合 |  |  [`数组`](/tag/array.md) [`数学`](/tag/math.md) [`字符串`](/tag/string.md) `2+` | 🔴 | [🀄️](https://leetcode.cn/problems/numbers-at-most-n-given-digit-set) [🔗](https://leetcode.com/problems/numbers-at-most-n-given-digit-set) |
 | 903 | DI 序列的有效排列 |  |  [`字符串`](/tag/string.md) [`动态规划`](/tag/dynamic-programming.md) [`前缀和`](/tag/prefix-sum.md) | 🔴 | [🀄️](https://leetcode.cn/problems/valid-permutations-for-di-sequence) [🔗](https://leetcode.com/problems/valid-permutations-for-di-sequence) |
 
@@ -5654,7 +5654,7 @@ headerDepth: 0
 | 860 | 柠檬水找零 |  |  [`贪心`](/tag/greedy.md) [`数组`](/tag/array.md) | 🟢 | [🀄️](https://leetcode.cn/problems/lemonade-change) [🔗](https://leetcode.com/problems/lemonade-change) |
 | 863 | 二叉树中所有距离为 K 的结点 |  |  [`树`](/tag/tree.md) [`深度优先搜索`](/tag/depth-first-search.md) [`广度优先搜索`](/tag/breadth-first-search.md) `2+` | 🟠 | [🀄️](https://leetcode.cn/problems/all-nodes-distance-k-in-binary-tree) [🔗](https://leetcode.com/problems/all-nodes-distance-k-in-binary-tree) |
 | 861 | 翻转矩阵后的得分 |  |  [`贪心`](/tag/greedy.md) [`位运算`](/tag/bit-manipulation.md) [`数组`](/tag/array.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/score-after-flipping-matrix) [🔗](https://leetcode.com/problems/score-after-flipping-matrix) |
-| 862 | 和至少为 K 的最短子数组 |  |  [`队列`](/tag/queue.md) [`数组`](/tag/array.md) [`二分查找`](/tag/binary-search.md) `4+` | 🔴 | [🀄️](https://leetcode.cn/problems/shortest-subarray-with-sum-at-least-k) [🔗](https://leetcode.com/problems/shortest-subarray-with-sum-at-least-k) |
+| 862 | 和至少为 K 的最短子数组 | [[✓]](/problem/0862.md) |  [`队列`](/tag/queue.md) [`数组`](/tag/array.md) [`二分查找`](/tag/binary-search.md) `4+` | 🔴 | [🀄️](https://leetcode.cn/problems/shortest-subarray-with-sum-at-least-k) [🔗](https://leetcode.com/problems/shortest-subarray-with-sum-at-least-k) |
 
 
 ## Weekly Contest 90 (2018-06-24 09:30)

src/plan/top_200_list.md

@@ -524,7 +524,7 @@ headerDepth: 0
 | :------: | :------ | :------: | :------ | :------ | :------: | :------: |
 | 3 | 无重复字符的最长子串 | [[✓]](/problem/0003.md) |  [`哈希表`](/tag/hash-table.md) [`字符串`](/tag/string.md) [`滑动窗口`](/tag/sliding-window.md) | 🟠 | [🀄️](https://leetcode.cn/problems/longest-substring-without-repeating-characters) [🔗](https://leetcode.com/problems/longest-substring-without-repeating-characters) | 642 |
 | 76 | 最小覆盖子串 | [[✓]](/problem/0076.md) |  [`哈希表`](/tag/hash-table.md) [`字符串`](/tag/string.md) [`滑动窗口`](/tag/sliding-window.md) | 🔴 | [🀄️](https://leetcode.cn/problems/minimum-window-substring) [🔗](https://leetcode.com/problems/minimum-window-substring) | 87 |
-| 862 | 和至少为 K 的最短子数组 |  |  [`队列`](/tag/queue.md) [`数组`](/tag/array.md) [`二分查找`](/tag/binary-search.md) `4+` | 🔴 | [🀄️](https://leetcode.cn/problems/shortest-subarray-with-sum-at-least-k) [🔗](https://leetcode.com/problems/shortest-subarray-with-sum-at-least-k) | 16 |
+| 862 | 和至少为 K 的最短子数组 | [[✓]](/problem/0862.md) |  [`队列`](/tag/queue.md) [`数组`](/tag/array.md) [`二分查找`](/tag/binary-search.md) `4+` | 🔴 | [🀄️](https://leetcode.cn/problems/shortest-subarray-with-sum-at-least-k) [🔗](https://leetcode.com/problems/shortest-subarray-with-sum-at-least-k) | 16 |
 | 1004 | 最大连续1的个数 III | [[✓]](/problem/1004.md) |  [`数组`](/tag/array.md) [`二分查找`](/tag/binary-search.md) [`前缀和`](/tag/prefix-sum.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/max-consecutive-ones-iii) [🔗](https://leetcode.com/problems/max-consecutive-ones-iii) | 22 |