560 662 1942

Author: 2xiao

assets/image/3-4-3.png

@@ -346,6 +346,7 @@ export default sidebar({
             "0543",
             "0557",
             "0559",
+            "0560",
             "0567",
             "0572",
             "0583",
@@ -363,6 +364,7 @@ export default sidebar({
             "0637",
             "0641",
             "0654",
+            "0662",
             "0678",
             "0682",
             "0695"
@@ -479,6 +481,7 @@ export default sidebar({
           text: "1900-1999",
           collapsible: true,
           children: [
+            "1942",
             "1963"
           ],
         },
@@ -581,7 +584,9 @@ export default sidebar({
             "jz_offer_54_1",
             "jz_offer_55_1",
             "jz_offer_58_1",
+            "jz_offer_60_1",
             "jz_offer_61_1",
+            "jz_offer_62_1",
             "jz_offer_63_1"
           ],
         },

assets/image/3-4-4.png

@@ -325,5 +325,5 @@
 | 1467 | [两个盒子中球的颜色数相同的概率](https://leetcode.com/problems/probability-of-a-two-boxes-having-the-same-number-of-distinct-balls) |  |  [`数组`](/leetcode/outline/tag/array.md) [`数学`](/leetcode/outline/tag/math.md) [`动态规划`](/leetcode/outline/tag/dynamic-programming.md) `3+` | <font color=#ff334b>Hard</font> |
 | 1227 | [飞机座位分配概率](https://leetcode.com/problems/airplane-seat-assignment-probability) |  |  [`脑筋急转弯`](/leetcode/outline/tag/brainteaser.md) [`数学`](/leetcode/outline/tag/math.md) [`动态规划`](/leetcode/outline/tag/dynamic-programming.md) `1+` | <font color=#ffb800>Medium</font> |
 | 1377 | [T 秒后青蛙的位置](https://leetcode.com/problems/frog-position-after-t-seconds) |  |  [`树`](/leetcode/outline/tag/tree.md) [`深度优先搜索`](/leetcode/outline/tag/depth-first-search.md) [`广度优先搜索`](/leetcode/outline/tag/breadth-first-search.md) `1+` | <font color=#ff334b>Hard</font> |
-| 剑指 Offer 60 | [n个骰子的点数](https://leetcode.cn/problems/nge-tou-zi-de-dian-shu-lcof) |  |  [`数学`](/leetcode/outline/tag/math.md) [`动态规划`](/leetcode/outline/tag/dynamic-programming.md) [`概率与统计`](/leetcode/outline/tag/probability-and-statistics.md) | <font color=#ffb800>Medium</font> |
+| 剑指 Offer 60 | [n个骰子的点数](https://leetcode.cn/problems/nge-tou-zi-de-dian-shu-lcof) | [[✓]](https://2xiao.github.io/leetcode-js/leetcode/problem/jz_offer_60_1) |  [`数学`](/leetcode/outline/tag/math.md) [`动态规划`](/leetcode/outline/tag/dynamic-programming.md) [`概率与统计`](/leetcode/outline/tag/probability-and-statistics.md) | <font color=#ffb800>Medium</font> |
 

src/.vuepress/sidebar.ts

@@ -18,5 +18,5 @@
 | 剑指 Offer 57 - II | [和为s的连续正数序列](https://leetcode.cn/problems/he-wei-sde-lian-xu-zheng-shu-xu-lie-lcof) |  |  [`数学`](/leetcode/outline/tag/math.md) [`双指针`](/leetcode/outline/tag/two-pointers.md) [`枚举`](/leetcode/outline/tag/enumeration.md) | <font color=#15bd66>Easy</font> |
 | 800 | [相似 RGB 颜色](https://leetcode.com/problems/similar-rgb-color) |  |  [`数学`](/leetcode/outline/tag/math.md) [`字符串`](/leetcode/outline/tag/string.md) [`枚举`](/leetcode/outline/tag/enumeration.md) | <font color=#15bd66>Easy</font> |
 | 221 | [最大正方形](https://leetcode.com/problems/maximal-square) | [[✓]](https://2xiao.github.io/leetcode-js/leetcode/problem/0221) |  [`数组`](/leetcode/outline/tag/array.md) [`动态规划`](/leetcode/outline/tag/dynamic-programming.md) [`矩阵`](/leetcode/outline/tag/matrix.md) | <font color=#ffb800>Medium</font> |
-| 560 | [和为 K 的子数组](https://leetcode.com/problems/subarray-sum-equals-k) |  |  [`数组`](/leetcode/outline/tag/array.md) [`哈希表`](/leetcode/outline/tag/hash-table.md) [`前缀和`](/leetcode/outline/tag/prefix-sum.md) | <font color=#ffb800>Medium</font> |
+| 560 | [和为 K 的子数组](https://leetcode.com/problems/subarray-sum-equals-k) | [[✓]](https://2xiao.github.io/leetcode-js/leetcode/problem/0560) |  [`数组`](/leetcode/outline/tag/array.md) [`哈希表`](/leetcode/outline/tag/hash-table.md) [`前缀和`](/leetcode/outline/tag/prefix-sum.md) | <font color=#ffb800>Medium</font> |
 

src/leetcode/algorithm/dynamic_programming.md

@@ -52,5 +52,5 @@ function f(n) {
 | 50 | [Pow(x, n)](https://leetcode.com/problems/powx-n) | [[✓]](https://2xiao.github.io/leetcode-js/leetcode/problem/0050) |  [`递归`](/leetcode/outline/tag/recursion.md) [`数学`](/leetcode/outline/tag/math.md) | <font color=#ffb800>Medium</font> |
 | 779 | [第K个语法符号](https://leetcode.com/problems/k-th-symbol-in-grammar) |  |  [`位运算`](/leetcode/outline/tag/bit-manipulation.md) [`递归`](/leetcode/outline/tag/recursion.md) [`数学`](/leetcode/outline/tag/math.md) | <font color=#ffb800>Medium</font> |
 | 95 | [不同的二叉搜索树 II](https://leetcode.com/problems/unique-binary-search-trees-ii) | [[✓]](https://2xiao.github.io/leetcode-js/leetcode/problem/0095) |  [`树`](/leetcode/outline/tag/tree.md) [`二叉搜索树`](/leetcode/outline/tag/binary-search-tree.md) [`动态规划`](/leetcode/outline/tag/dynamic-programming.md) `2+` | <font color=#ffb800>Medium</font> |
-| 剑指 Offer 62 | [圆圈中最后剩下的数字](https://leetcode.cn/problems/yuan-quan-zhong-zui-hou-sheng-xia-de-shu-zi-lcof) |  |  [`递归`](/leetcode/outline/tag/recursion.md) [`数学`](/leetcode/outline/tag/math.md) | <font color=#15bd66>Easy</font> |
+| 剑指 Offer 62 | [圆圈中最后剩下的数字](https://leetcode.cn/problems/yuan-quan-zhong-zui-hou-sheng-xia-de-shu-zi-lcof) | [[✓]](https://2xiao.github.io/leetcode-js/leetcode/problem/jz_offer_62_1) |  [`递归`](/leetcode/outline/tag/recursion.md) [`数学`](/leetcode/outline/tag/math.md) | <font color=#15bd66>Easy</font> |
 

src/leetcode/algorithm/enumeration.md

@@ -25,7 +25,7 @@
 | 124 | [二叉树中的最大路径和](https://leetcode.com/problems/binary-tree-maximum-path-sum) | [[✓]](https://2xiao.github.io/leetcode-js/leetcode/problem/0124) |  [`树`](/leetcode/outline/tag/tree.md) [`深度优先搜索`](/leetcode/outline/tag/depth-first-search.md) [`动态规划`](/leetcode/outline/tag/dynamic-programming.md) `1+` | <font color=#ff334b>Hard</font> |
 | 199 | [二叉树的右视图](https://leetcode.com/problems/binary-tree-right-side-view) | [[✓]](https://2xiao.github.io/leetcode-js/leetcode/problem/0199) |  [`树`](/leetcode/outline/tag/tree.md) [`深度优先搜索`](/leetcode/outline/tag/depth-first-search.md) [`广度优先搜索`](/leetcode/outline/tag/breadth-first-search.md) `1+` | <font color=#ffb800>Medium</font> |
 | 543 | [二叉树的直径](https://leetcode.com/problems/diameter-of-binary-tree) | [[✓]](https://2xiao.github.io/leetcode-js/leetcode/problem/0543) |  [`树`](/leetcode/outline/tag/tree.md) [`深度优先搜索`](/leetcode/outline/tag/depth-first-search.md) [`二叉树`](/leetcode/outline/tag/binary-tree.md) | <font color=#15bd66>Easy</font> |
-| 662 | [二叉树最大宽度](https://leetcode.com/problems/maximum-width-of-binary-tree) |  |  [`树`](/leetcode/outline/tag/tree.md) [`深度优先搜索`](/leetcode/outline/tag/depth-first-search.md) [`广度优先搜索`](/leetcode/outline/tag/breadth-first-search.md) `1+` | <font color=#ffb800>Medium</font> |
+| 662 | [二叉树最大宽度](https://leetcode.com/problems/maximum-width-of-binary-tree) | [[✓]](https://2xiao.github.io/leetcode-js/leetcode/problem/0662) |  [`树`](/leetcode/outline/tag/tree.md) [`深度优先搜索`](/leetcode/outline/tag/depth-first-search.md) [`广度优先搜索`](/leetcode/outline/tag/breadth-first-search.md) `1+` | <font color=#ffb800>Medium</font> |
 | 958 | [二叉树的完全性检验](https://leetcode.com/problems/check-completeness-of-a-binary-tree) | [[✓]](https://2xiao.github.io/leetcode-js/leetcode/problem/0958) |  [`树`](/leetcode/outline/tag/tree.md) [`广度优先搜索`](/leetcode/outline/tag/breadth-first-search.md) [`二叉树`](/leetcode/outline/tag/binary-tree.md) | <font color=#ffb800>Medium</font> |
 | 572 | [另一棵树的子树](https://leetcode.com/problems/subtree-of-another-tree) | [[✓]](https://2xiao.github.io/leetcode-js/leetcode/problem/0572) |  [`树`](/leetcode/outline/tag/tree.md) [`深度优先搜索`](/leetcode/outline/tag/depth-first-search.md) [`二叉树`](/leetcode/outline/tag/binary-tree.md) `2+` | <font color=#15bd66>Easy</font> |
 | 100 | [相同的树](https://leetcode.com/problems/same-tree) | [[✓]](https://2xiao.github.io/leetcode-js/leetcode/problem/0100) |  [`树`](/leetcode/outline/tag/tree.md) [`深度优先搜索`](/leetcode/outline/tag/depth-first-search.md) [`广度优先搜索`](/leetcode/outline/tag/breadth-first-search.md) `1+` | <font color=#15bd66>Easy</font> |
@@ -63,7 +63,7 @@
 | 323 | [无向图中连通分量的数目](https://leetcode.com/problems/number-of-connected-components-in-an-undirected-graph) |  |  [`深度优先搜索`](/leetcode/outline/tag/depth-first-search.md) [`广度优先搜索`](/leetcode/outline/tag/breadth-first-search.md) [`并查集`](/leetcode/outline/tag/union-find.md) `1+` | <font color=#ffb800>Medium</font> |
 | 剑指 Offer 13 | [机器人的运动范围](https://leetcode.cn/problems/ji-qi-ren-de-yun-dong-fan-wei-lcof) | [[✓]](https://2xiao.github.io/leetcode-js/leetcode/problem/jz_offer_13_1) |  [`深度优先搜索`](/leetcode/outline/tag/depth-first-search.md) [`广度优先搜索`](/leetcode/outline/tag/breadth-first-search.md) [`动态规划`](/leetcode/outline/tag/dynamic-programming.md) | <font color=#ffb800>Medium</font> |
 | 199 | [二叉树的右视图](https://leetcode.com/problems/binary-tree-right-side-view) | [[✓]](https://2xiao.github.io/leetcode-js/leetcode/problem/0199) |  [`树`](/leetcode/outline/tag/tree.md) [`深度优先搜索`](/leetcode/outline/tag/depth-first-search.md) [`广度优先搜索`](/leetcode/outline/tag/breadth-first-search.md) `1+` | <font color=#ffb800>Medium</font> |
-| 662 | [二叉树最大宽度](https://leetcode.com/problems/maximum-width-of-binary-tree) |  |  [`树`](/leetcode/outline/tag/tree.md) [`深度优先搜索`](/leetcode/outline/tag/depth-first-search.md) [`广度优先搜索`](/leetcode/outline/tag/breadth-first-search.md) `1+` | <font color=#ffb800>Medium</font> |
+| 662 | [二叉树最大宽度](https://leetcode.com/problems/maximum-width-of-binary-tree) | [[✓]](https://2xiao.github.io/leetcode-js/leetcode/problem/0662) |  [`树`](/leetcode/outline/tag/tree.md) [`深度优先搜索`](/leetcode/outline/tag/depth-first-search.md) [`广度优先搜索`](/leetcode/outline/tag/breadth-first-search.md) `1+` | <font color=#ffb800>Medium</font> |
 | 958 | [二叉树的完全性检验](https://leetcode.com/problems/check-completeness-of-a-binary-tree) | [[✓]](https://2xiao.github.io/leetcode-js/leetcode/problem/0958) |  [`树`](/leetcode/outline/tag/tree.md) [`广度优先搜索`](/leetcode/outline/tag/breadth-first-search.md) [`二叉树`](/leetcode/outline/tag/binary-tree.md) | <font color=#ffb800>Medium</font> |
 | 572 | [另一棵树的子树](https://leetcode.com/problems/subtree-of-another-tree) | [[✓]](https://2xiao.github.io/leetcode-js/leetcode/problem/0572) |  [`树`](/leetcode/outline/tag/tree.md) [`深度优先搜索`](/leetcode/outline/tag/depth-first-search.md) [`二叉树`](/leetcode/outline/tag/binary-tree.md) `2+` | <font color=#15bd66>Easy</font> |
 | 100 | [相同的树](https://leetcode.com/problems/same-tree) | [[✓]](https://2xiao.github.io/leetcode-js/leetcode/problem/0100) |  [`树`](/leetcode/outline/tag/tree.md) [`深度优先搜索`](/leetcode/outline/tag/depth-first-search.md) [`广度优先搜索`](/leetcode/outline/tag/breadth-first-search.md) `1+` | <font color=#15bd66>Easy</font> |

src/leetcode/algorithm/recursion.md

@@ -91,7 +91,7 @@ headerDepth: 0
 | 162 | [寻找峰值](https://leetcode.com/problems/find-peak-element) | [[✓]](https://2xiao.github.io/leetcode-js/leetcode/problem/0162) |  [`数组`](/leetcode/outline/tag/array.md) [`二分查找`](/leetcode/outline/tag/binary-search.md) | <font color=#ffb800>Medium</font> | 60 |
 | 226 | [翻转二叉树](https://leetcode.com/problems/invert-binary-tree) | [[✓]](https://2xiao.github.io/leetcode-js/leetcode/problem/0226) |  [`树`](/leetcode/outline/tag/tree.md) [`深度优先搜索`](/leetcode/outline/tag/depth-first-search.md) [`广度优先搜索`](/leetcode/outline/tag/breadth-first-search.md) `1+` | <font color=#15bd66>Easy</font> | 59 |
 | 14 | [最长公共前缀](https://leetcode.com/problems/longest-common-prefix) | [[✓]](https://2xiao.github.io/leetcode-js/leetcode/problem/0014) |  [`字典树`](/leetcode/outline/tag/trie.md) [`字符串`](/leetcode/outline/tag/string.md) | <font color=#15bd66>Easy</font> | 58 |
-| 662 | [二叉树最大宽度](https://leetcode.com/problems/maximum-width-of-binary-tree) |  |  [`树`](/leetcode/outline/tag/tree.md) [`深度优先搜索`](/leetcode/outline/tag/depth-first-search.md) [`广度优先搜索`](/leetcode/outline/tag/breadth-first-search.md) `1+` | <font color=#ffb800>Medium</font> | 57 |
+| 662 | [二叉树最大宽度](https://leetcode.com/problems/maximum-width-of-binary-tree) | [[✓]](https://2xiao.github.io/leetcode-js/leetcode/problem/0662) |  [`树`](/leetcode/outline/tag/tree.md) [`深度优先搜索`](/leetcode/outline/tag/depth-first-search.md) [`广度优先搜索`](/leetcode/outline/tag/breadth-first-search.md) `1+` | <font color=#ffb800>Medium</font> | 57 |
 | 122 | [买卖股票的最佳时机 II](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii) | [[✓]](https://2xiao.github.io/leetcode-js/leetcode/problem/0122) |  [`贪心`](/leetcode/outline/tag/greedy.md) [`数组`](/leetcode/outline/tag/array.md) [`动态规划`](/leetcode/outline/tag/dynamic-programming.md) | <font color=#ffb800>Medium</font> | 56 |
 | 695 | [岛屿的最大面积](https://leetcode.com/problems/max-area-of-island) | [[✓]](https://2xiao.github.io/leetcode-js/leetcode/problem/0695) |  [`深度优先搜索`](/leetcode/outline/tag/depth-first-search.md) [`广度优先搜索`](/leetcode/outline/tag/breadth-first-search.md) [`并查集`](/leetcode/outline/tag/union-find.md) `2+` | <font color=#ffb800>Medium</font> | 56 |
 | 128 | [最长连续序列](https://leetcode.com/problems/longest-consecutive-sequence) | [[✓]](https://2xiao.github.io/leetcode-js/leetcode/problem/0128) |  [`并查集`](/leetcode/outline/tag/union-find.md) [`数组`](/leetcode/outline/tag/array.md) [`哈希表`](/leetcode/outline/tag/hash-table.md) | <font color=#ffb800>Medium</font> | 56 |
@@ -104,7 +104,7 @@ headerDepth: 0
 | 198 | [打家劫舍](https://leetcode.com/problems/house-robber) | [[✓]](https://2xiao.github.io/leetcode-js/leetcode/problem/0198) |  [`数组`](/leetcode/outline/tag/array.md) [`动态规划`](/leetcode/outline/tag/dynamic-programming.md) | <font color=#ffb800>Medium</font> | 51 |
 | 24 | [两两交换链表中的节点](https://leetcode.com/problems/swap-nodes-in-pairs) | [[✓]](https://2xiao.github.io/leetcode-js/leetcode/problem/0024) |  [`递归`](/leetcode/outline/tag/recursion.md) [`链表`](/leetcode/outline/tag/linked-list.md) | <font color=#ffb800>Medium</font> | 50 |
 | 283 | [移动零](https://leetcode.com/problems/move-zeroes) | [[✓]](https://2xiao.github.io/leetcode-js/leetcode/problem/0283) |  [`数组`](/leetcode/outline/tag/array.md) [`双指针`](/leetcode/outline/tag/two-pointers.md) | <font color=#15bd66>Easy</font> | 49 |
-| 560 | [和为 K 的子数组](https://leetcode.com/problems/subarray-sum-equals-k) |  |  [`数组`](/leetcode/outline/tag/array.md) [`哈希表`](/leetcode/outline/tag/hash-table.md) [`前缀和`](/leetcode/outline/tag/prefix-sum.md) | <font color=#ffb800>Medium</font> | 49 |
+| 560 | [和为 K 的子数组](https://leetcode.com/problems/subarray-sum-equals-k) | [[✓]](https://2xiao.github.io/leetcode-js/leetcode/problem/0560) |  [`数组`](/leetcode/outline/tag/array.md) [`哈希表`](/leetcode/outline/tag/hash-table.md) [`前缀和`](/leetcode/outline/tag/prefix-sum.md) | <font color=#ffb800>Medium</font> | 49 |
 | 209 | [长度最小的子数组](https://leetcode.com/problems/minimum-size-subarray-sum) | [[✓]](https://2xiao.github.io/leetcode-js/leetcode/problem/0209) |  [`数组`](/leetcode/outline/tag/array.md) [`二分查找`](/leetcode/outline/tag/binary-search.md) [`前缀和`](/leetcode/outline/tag/prefix-sum.md) `1+` | <font color=#ffb800>Medium</font> | 49 |
 | 297 | [二叉树的序列化与反序列化](https://leetcode.com/problems/serialize-and-deserialize-binary-tree) | [[✓]](https://2xiao.github.io/leetcode-js/leetcode/problem/0297) |  [`树`](/leetcode/outline/tag/tree.md) [`深度优先搜索`](/leetcode/outline/tag/depth-first-search.md) [`广度优先搜索`](/leetcode/outline/tag/breadth-first-search.md) `3+` | <font color=#ff334b>Hard</font> | 49 |
 | 153 | [寻找旋转排序数组中的最小值](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array) | [[✓]](https://2xiao.github.io/leetcode-js/leetcode/problem/0153) |  [`数组`](/leetcode/outline/tag/array.md) [`二分查找`](/leetcode/outline/tag/binary-search.md) | <font color=#ffb800>Medium</font> | 49 |
@@ -147,7 +147,7 @@ headerDepth: 0
 | 剑指 Offer 26 | [树的子结构](https://leetcode.cn/problems/shu-de-zi-jie-gou-lcof) | [[✓]](https://2xiao.github.io/leetcode-js/leetcode/problem/jz_offer_26_1) |  [`树`](/leetcode/outline/tag/tree.md) [`深度优先搜索`](/leetcode/outline/tag/depth-first-search.md) [`二叉树`](/leetcode/outline/tag/binary-tree.md) | <font color=#ffb800>Medium</font> | 32 |
 | 45 | [跳跃游戏 II](https://leetcode.com/problems/jump-game-ii) | [[✓]](https://2xiao.github.io/leetcode-js/leetcode/problem/0045) |  [`贪心`](/leetcode/outline/tag/greedy.md) [`数组`](/leetcode/outline/tag/array.md) [`动态规划`](/leetcode/outline/tag/dynamic-programming.md) | <font color=#ffb800>Medium</font> | 31 |
 | 230 | [二叉搜索树中第 K 小的元素](https://leetcode.com/problems/kth-smallest-element-in-a-bst) | [[✓]](https://2xiao.github.io/leetcode-js/leetcode/problem/0230) |  [`树`](/leetcode/outline/tag/tree.md) [`深度优先搜索`](/leetcode/outline/tag/depth-first-search.md) [`二叉搜索树`](/leetcode/outline/tag/binary-search-tree.md) `1+` | <font color=#ffb800>Medium</font> | 31 |
-| 剑指 Offer 62 | [圆圈中最后剩下的数字](https://leetcode.cn/problems/yuan-quan-zhong-zui-hou-sheng-xia-de-shu-zi-lcof) |  |  [`递归`](/leetcode/outline/tag/recursion.md) [`数学`](/leetcode/outline/tag/math.md) | <font color=#15bd66>Easy</font> | 30 |
+| 剑指 Offer 62 | [圆圈中最后剩下的数字](https://leetcode.cn/problems/yuan-quan-zhong-zui-hou-sheng-xia-de-shu-zi-lcof) | [[✓]](https://2xiao.github.io/leetcode-js/leetcode/problem/jz_offer_62_1) |  [`递归`](/leetcode/outline/tag/recursion.md) [`数学`](/leetcode/outline/tag/math.md) | <font color=#15bd66>Easy</font> | 30 |
 | 剑指 Offer 21 | [调整数组顺序使奇数位于偶数前面](https://leetcode.cn/problems/diao-zheng-shu-zu-shun-xu-shi-qi-shu-wei-yu-ou-shu-qian-mian-lcof) | [[✓]](https://2xiao.github.io/leetcode-js/leetcode/problem/jz_offer_21_1) |  [`数组`](/leetcode/outline/tag/array.md) [`双指针`](/leetcode/outline/tag/two-pointers.md) [`排序`](/leetcode/outline/tag/sorting.md) | <font color=#15bd66>Easy</font> | 30 |
 | 16 | [最接近的三数之和](https://leetcode.com/problems/3sum-closest) | [[✓]](https://2xiao.github.io/leetcode-js/leetcode/problem/0016) |  [`数组`](/leetcode/outline/tag/array.md) [`双指针`](/leetcode/outline/tag/two-pointers.md) [`排序`](/leetcode/outline/tag/sorting.md) | <font color=#ffb800>Medium</font> | 29 |
 | 125 | [验证回文串](https://leetcode.com/problems/valid-palindrome) | [[✓]](https://2xiao.github.io/leetcode-js/leetcode/problem/0125) |  [`双指针`](/leetcode/outline/tag/two-pointers.md) [`字符串`](/leetcode/outline/tag/string.md) | <font color=#15bd66>Easy</font> | 29 |