Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly
Sign up
Appearance settings

Commit c480a87

Browse files
committed
Deploying to main from @ 358664d 🚀
1 parent 18749c5 commit c480a87

Some content is hidden

Large Commits have some content hidden by default. Use the searchbox below for content that may be hidden.

69 files changed

+4324
-106
lines changed

‎book/bit.md

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -10,7 +10,7 @@
1010
<!-- prettier-ignore -->
1111
| 题号 | 标题 | 题解 | 标签 | 难度 | 力扣 |
1212
| :------: | :------ | :------: | :------ | :------: | :------: |
13-
| 504 | 七进制数 | | [`数学`](/tag/math.md) | 🟢 | [🀄️](https://leetcode.cn/problems/base-7) [🔗](https://leetcode.com/problems/base-7) |
13+
| 504 | 七进制数 | [[✓]](/problem/0504.md) | [`数学`](/tag/math.md) | 🟢 | [🀄️](https://leetcode.cn/problems/base-7) [🔗](https://leetcode.com/problems/base-7) |
1414
| 405 | 数字转换为十六进制数 | [[✓]](/problem/0405.md) | [`位运算`](/tag/bit-manipulation.md) [`数学`](/tag/math.md) | 🟢 | [🀄️](https://leetcode.cn/problems/convert-a-number-to-hexadecimal) [🔗](https://leetcode.com/problems/convert-a-number-to-hexadecimal) |
1515
| 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) |
1616
| 1009 | 十进制整数的反码 | [[✓]](/problem/1009.md) | [`位运算`](/tag/bit-manipulation.md) | 🟢 | [🀄️](https://leetcode.cn/problems/complement-of-base-10-integer) [🔗](https://leetcode.com/problems/complement-of-base-10-integer) |
@@ -24,7 +24,7 @@
2424
| 260 | 只出现一次的数字 III | | [`位运算`](/tag/bit-manipulation.md) [`数组`](/tag/array.md) | 🟠 | [🀄️](https://leetcode.cn/problems/single-number-iii) [🔗](https://leetcode.com/problems/single-number-iii) |
2525
| 268 | 丢失的数字 | [[✓]](/problem/0268.md) | [`位运算`](/tag/bit-manipulation.md) [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) `3+` | 🟢 | [🀄️](https://leetcode.cn/problems/missing-number) [🔗](https://leetcode.com/problems/missing-number) |
2626
| 1349 | 参加考试的最大学生数 | | [`位运算`](/tag/bit-manipulation.md) [`数组`](/tag/array.md) [`动态规划`](/tag/dynamic-programming.md) `2+` | 🔴 | [🀄️](https://leetcode.cn/problems/maximum-students-taking-exam) [🔗](https://leetcode.com/problems/maximum-students-taking-exam) |
27-
| 645 | 错误的集合 | | [`位运算`](/tag/bit-manipulation.md) [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) `1+` | 🟢 | [🀄️](https://leetcode.cn/problems/set-mismatch) [🔗](https://leetcode.com/problems/set-mismatch) |
27+
| 645 | 错误的集合 | [[✓]](/problem/0645.md) | [`位运算`](/tag/bit-manipulation.md) [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) `1+` | 🟢 | [🀄️](https://leetcode.cn/problems/set-mismatch) [🔗](https://leetcode.com/problems/set-mismatch) |
2828
| 78 | 子集 | [[✓]](/problem/0078.md) | [`位运算`](/tag/bit-manipulation.md) [`数组`](/tag/array.md) [`回溯`](/tag/backtracking.md) | 🟠 | [🀄️](https://leetcode.cn/problems/subsets) [🔗](https://leetcode.com/problems/subsets) |
2929
| 90 | 子集 II | [[✓]](/problem/0090.md) | [`位运算`](/tag/bit-manipulation.md) [`数组`](/tag/array.md) [`回溯`](/tag/backtracking.md) | 🟠 | [🀄️](https://leetcode.cn/problems/subsets-ii) [🔗](https://leetcode.com/problems/subsets-ii) |
3030

‎book/greedy.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -31,7 +31,7 @@
3131
| 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) |
3232
| 392 | 判断子序列 | [[✓]](/problem/0392.md) | [`双指针`](/tag/two-pointers.md) [`字符串`](/tag/string.md) [`动态规划`](/tag/dynamic-programming.md) | 🟢 | [🀄️](https://leetcode.cn/problems/is-subsequence) [🔗](https://leetcode.com/problems/is-subsequence) |
3333
| 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) |
34-
| 561 | 数组拆分 | | [`贪心`](/tag/greedy.md) [`数组`](/tag/array.md) [`计数排序`](/tag/counting-sort.md) `1+` | 🟢 | [🀄️](https://leetcode.cn/problems/array-partition) [🔗](https://leetcode.com/problems/array-partition) |
34+
| 561 | 数组拆分 | [[✓]](/problem/0561.md) | [`贪心`](/tag/greedy.md) [`数组`](/tag/array.md) [`计数排序`](/tag/counting-sort.md) `1+` | 🟢 | [🀄️](https://leetcode.cn/problems/array-partition) [🔗](https://leetcode.com/problems/array-partition) |
3535
| 1710 | 卡车上的最大单元数 | | [`贪心`](/tag/greedy.md) [`数组`](/tag/array.md) [`排序`](/tag/sorting.md) | 🟢 | [🀄️](https://leetcode.cn/problems/maximum-units-on-a-truck) [🔗](https://leetcode.com/problems/maximum-units-on-a-truck) |
3636
| 1217 | 玩筹码 | | [`贪心`](/tag/greedy.md) [`数组`](/tag/array.md) [`数学`](/tag/math.md) | 🟢 | [🀄️](https://leetcode.cn/problems/minimum-cost-to-move-chips-to-the-same-position) [🔗](https://leetcode.com/problems/minimum-cost-to-move-chips-to-the-same-position) |
3737
| 1247 | 交换字符使得字符串相同 | | [`贪心`](/tag/greedy.md) [`数学`](/tag/math.md) [`字符串`](/tag/string.md) | 🟠 | [🀄️](https://leetcode.cn/problems/minimum-swaps-to-make-strings-equal) [🔗](https://leetcode.com/problems/minimum-swaps-to-make-strings-equal) |

‎book/hash.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -679,7 +679,7 @@ jsonToMap('[[true,7],[{"foo":3},["abc"]]]');
679679
| 剑指 Offer 3 | 数组中重复的数字 | [[✓]](/offer/jz_offer_03_1.md) | [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) [`排序`](/tag/sorting.md) | 🟢 | [🀄️](https://leetcode.cn/problems/shu-zu-zhong-zhong-fu-de-shu-zi-lcof) |
680680
| 451 | 根据字符出现频率排序 | [[✓]](/problem/0451.md) | [`哈希表`](/tag/hash-table.md) [`字符串`](/tag/string.md) [`桶排序`](/tag/bucket-sort.md) `3+` | 🟠 | [🀄️](https://leetcode.cn/problems/sort-characters-by-frequency) [🔗](https://leetcode.com/problems/sort-characters-by-frequency) |
681681
| 49 | 字母异位词分组 | [[✓]](/problem/0049.md) | [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) [`字符串`](/tag/string.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/group-anagrams) [🔗](https://leetcode.com/problems/group-anagrams) |
682-
| 599 | 两个列表的最小索引总和 | | [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) [`字符串`](/tag/string.md) | 🟢 | [🀄️](https://leetcode.cn/problems/minimum-index-sum-of-two-lists) [🔗](https://leetcode.com/problems/minimum-index-sum-of-two-lists) |
682+
| 599 | 两个列表的最小索引总和 | [[✓]](/problem/0599.md) | [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) [`字符串`](/tag/string.md) | 🟢 | [🀄️](https://leetcode.cn/problems/minimum-index-sum-of-two-lists) [🔗](https://leetcode.com/problems/minimum-index-sum-of-two-lists) |
683683
| 387 | 字符串中的第一个唯一字符 | [[✓]](/problem/0387.md) | [`队列`](/tag/queue.md) [`哈希表`](/tag/hash-table.md) [`字符串`](/tag/string.md) `1+` | 🟢 | [🀄️](https://leetcode.cn/problems/first-unique-character-in-a-string) [🔗](https://leetcode.com/problems/first-unique-character-in-a-string) |
684684
| 447 | 回旋镖的数量 | | [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) [`数学`](/tag/math.md) | 🟠 | [🀄️](https://leetcode.cn/problems/number-of-boomerangs) [🔗](https://leetcode.com/problems/number-of-boomerangs) |
685685
| 149 | 直线上最多的点数 | [[✓]](/problem/0149.md) | [`几何`](/tag/geometry.md) [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) `1+` | 🔴 | [🀄️](https://leetcode.cn/problems/max-points-on-a-line) [🔗](https://leetcode.com/problems/max-points-on-a-line) |

‎book/slide_window.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -568,7 +568,7 @@ var lengthOfLongestSubstring = function (s) {
568568
<!-- prettier-ignore -->
569569
| 题号 | 标题 | 题解 | 标签 | 难度 | 力扣 |
570570
| :------: | :------ | :------: | :------ | :------: | :------: |
571-
| 674 | 最长连续递增序列 | | [`数组`](/tag/array.md) | 🟢 | [🀄️](https://leetcode.cn/problems/longest-continuous-increasing-subsequence) [🔗](https://leetcode.com/problems/longest-continuous-increasing-subsequence) |
571+
| 674 | 最长连续递增序列 | [[✓]](/problem/0674.md) | [`数组`](/tag/array.md) | 🟢 | [🀄️](https://leetcode.cn/problems/longest-continuous-increasing-subsequence) [🔗](https://leetcode.com/problems/longest-continuous-increasing-subsequence) |
572572
| 485 | 最大连续 1 的个数 | [[✓]](/problem/0485.md) | [`数组`](/tag/array.md) | 🟢 | [🀄️](https://leetcode.cn/problems/max-consecutive-ones) [🔗](https://leetcode.com/problems/max-consecutive-ones) |
573573
| 487 | 最大连续1的个数 II 🔒 | | [`数组`](/tag/array.md) [`动态规划`](/tag/dynamic-programming.md) [`滑动窗口`](/tag/sliding-window.md) | 🟠 | [🀄️](https://leetcode.cn/problems/max-consecutive-ones-ii) [🔗](https://leetcode.com/problems/max-consecutive-ones-ii) |
574574
| 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) |

‎book/sort.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -418,7 +418,7 @@ function swap(arr, i, j) {
418418
| 题号 | 标题 | 题解 | 标签 | 难度 | 力扣 |
419419
| :------: | :------ | :------: | :------ | :------: | :------: |
420420
| 164 | 最大间距 | | [`数组`](/tag/array.md) [`桶排序`](/tag/bucket-sort.md) [`基数排序`](/tag/radix-sort.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/maximum-gap) [🔗](https://leetcode.com/problems/maximum-gap) |
421-
| 561 | 数组拆分 | | [`贪心`](/tag/greedy.md) [`数组`](/tag/array.md) [`计数排序`](/tag/counting-sort.md) `1+` | 🟢 | [🀄️](https://leetcode.cn/problems/array-partition) [🔗](https://leetcode.com/problems/array-partition) |
421+
| 561 | 数组拆分 | [[✓]](/problem/0561.md) | [`贪心`](/tag/greedy.md) [`数组`](/tag/array.md) [`计数排序`](/tag/counting-sort.md) `1+` | 🟢 | [🀄️](https://leetcode.cn/problems/array-partition) [🔗](https://leetcode.com/problems/array-partition) |
422422

423423
* 其他排序
424424

‎plan/rabbit_list.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -246,7 +246,7 @@ headerDepth: 0
246246
| 463 | 岛屿的周长 | [[✓]](/problem/0463.md) | [`深度优先搜索`](/tag/depth-first-search.md) [`广度优先搜索`](/tag/breadth-first-search.md) [`数组`](/tag/array.md) `1+` | 🟢 | [🀄️](https://leetcode.cn/problems/island-perimeter) [🔗](https://leetcode.com/problems/island-perimeter) | 4 |
247247
| 314 | 二叉树的垂直遍历 🔒 | | [`树`](/tag/tree.md) [`深度优先搜索`](/tag/depth-first-search.md) [`广度优先搜索`](/tag/breadth-first-search.md) `3+` | 🟠 | [🀄️](https://leetcode.cn/problems/binary-tree-vertical-order-traversal) [🔗](https://leetcode.com/problems/binary-tree-vertical-order-traversal) | 4 |
248248
| 799 | 香槟塔 | | [`动态规划`](/tag/dynamic-programming.md) | 🟠 | [🀄️](https://leetcode.cn/problems/champagne-tower) [🔗](https://leetcode.com/problems/champagne-tower) | 3 |
249-
| 680 | 验证回文串 II | | [`贪心`](/tag/greedy.md) [`双指针`](/tag/two-pointers.md) [`字符串`](/tag/string.md) | 🟢 | [🀄️](https://leetcode.cn/problems/valid-palindrome-ii) [🔗](https://leetcode.com/problems/valid-palindrome-ii) | 3 |
249+
| 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) | 3 |
250250
| 90 | 子集 II | [[✓]](/problem/0090.md) | [`位运算`](/tag/bit-manipulation.md) [`数组`](/tag/array.md) [`回溯`](/tag/backtracking.md) | 🟠 | [🀄️](https://leetcode.cn/problems/subsets-ii) [🔗](https://leetcode.com/problems/subsets-ii) | 3 |
251251
| 155 | 最小栈 | [[✓]](/problem/0155.md) | [`栈`](/tag/stack.md) [`设计`](/tag/design.md) | 🟠 | [🀄️](https://leetcode.cn/problems/min-stack) [🔗](https://leetcode.com/problems/min-stack) | 3 |
252252
| 79 | 单词搜索 | [[✓]](/problem/0079.md) | [`数组`](/tag/array.md) [`字符串`](/tag/string.md) [`回溯`](/tag/backtracking.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/word-search) [🔗](https://leetcode.com/problems/word-search) | 2 |

‎plan/top_300_list.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -545,7 +545,7 @@ headerDepth: 0
545545
| 题号 | 标题 | 题解 | 标签 | 难度 | 力扣 |
546546
| :------: | :------ | :------: | :------ | :------: | :------: |
547547
| 204 | 计数质数 | | [`数组`](/tag/array.md) [`数学`](/tag/math.md) [`枚举`](/tag/enumeration.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/count-primes) [🔗](https://leetcode.com/problems/count-primes) |
548-
| 628 | 三个数的最大乘积 | | [`数组`](/tag/array.md) [`数学`](/tag/math.md) [`排序`](/tag/sorting.md) | 🟢 | [🀄️](https://leetcode.cn/problems/maximum-product-of-three-numbers) [🔗](https://leetcode.com/problems/maximum-product-of-three-numbers) |
548+
| 628 | 三个数的最大乘积 | [[✓]](/problem/0628.md) | [`数组`](/tag/array.md) [`数学`](/tag/math.md) [`排序`](/tag/sorting.md) | 🟢 | [🀄️](https://leetcode.cn/problems/maximum-product-of-three-numbers) [🔗](https://leetcode.com/problems/maximum-product-of-three-numbers) |
549549
| 976 | 三角形的最大周长 | | [`贪心`](/tag/greedy.md) [`数组`](/tag/array.md) [`数学`](/tag/math.md) `1+` | 🟢 | [🀄️](https://leetcode.cn/problems/largest-perimeter-triangle) [🔗](https://leetcode.com/problems/largest-perimeter-triangle) |
550550
| 202 | 快乐数 | [[✓]](/problem/0202.md) | [`哈希表`](/tag/hash-table.md) [`数学`](/tag/math.md) [`双指针`](/tag/two-pointers.md) | 🟢 | [🀄️](https://leetcode.cn/problems/happy-number) [🔗](https://leetcode.com/problems/happy-number) |
551551
| 1232 | 缀点成线 | | [`几何`](/tag/geometry.md) [`数组`](/tag/array.md) [`数学`](/tag/math.md) | 🟢 | [🀄️](https://leetcode.cn/problems/check-if-it-is-a-straight-line) [🔗](https://leetcode.com/problems/check-if-it-is-a-straight-line) |

‎problem/0001.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -92,7 +92,7 @@ var twoSum = function (nums, target) {
9292
| 167 | 两数之和 II - 输入有序数组 | [[✓]](/problem/0167.md) | [`数组`](/tag/array.md) [`双指针`](/tag/two-pointers.md) [`二分查找`](/tag/binary-search.md) | 🟠 | [🀄️](https://leetcode.cn/problems/two-sum-ii-input-array-is-sorted) [🔗](https://leetcode.com/problems/two-sum-ii-input-array-is-sorted) |
9393
| 170 | 两数之和 III - 数据结构设计 🔒 | [[✓]](/problem/0170.md) | [`设计`](/tag/design.md) [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) `2+` | 🟢 | [🀄️](https://leetcode.cn/problems/two-sum-iii-data-structure-design) [🔗](https://leetcode.com/problems/two-sum-iii-data-structure-design) |
9494
| 560 | 和为 K 的子数组 | [[✓]](/problem/0560.md) | [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) [`前缀和`](/tag/prefix-sum.md) | 🟠 | [🀄️](https://leetcode.cn/problems/subarray-sum-equals-k) [🔗](https://leetcode.com/problems/subarray-sum-equals-k) |
95-
| 653 | 两数之和 IV - 输入二叉搜索树 | | [`树`](/tag/tree.md) [`深度优先搜索`](/tag/depth-first-search.md) [`广度优先搜索`](/tag/breadth-first-search.md) `4+` | 🟢 | [🀄️](https://leetcode.cn/problems/two-sum-iv-input-is-a-bst) [🔗](https://leetcode.com/problems/two-sum-iv-input-is-a-bst) |
95+
| 653 | 两数之和 IV - 输入二叉搜索树 | [[✓]](/problem/0653.md) | [`树`](/tag/tree.md) [`深度优先搜索`](/tag/depth-first-search.md) [`广度优先搜索`](/tag/breadth-first-search.md) `4+` | 🟢 | [🀄️](https://leetcode.cn/problems/two-sum-iv-input-is-a-bst) [🔗](https://leetcode.com/problems/two-sum-iv-input-is-a-bst) |
9696
| 1099 | 小于 K 的两数之和 🔒 | | [`数组`](/tag/array.md) [`双指针`](/tag/two-pointers.md) [`二分查找`](/tag/binary-search.md) `1+` | 🟢 | [🀄️](https://leetcode.cn/problems/two-sum-less-than-k) [🔗](https://leetcode.com/problems/two-sum-less-than-k) |
9797
| 1679 | K 和数对的最大数目 | [[✓]](/problem/1679.md) | [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) [`双指针`](/tag/two-pointers.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/max-number-of-k-sum-pairs) [🔗](https://leetcode.com/problems/max-number-of-k-sum-pairs) |
9898
| 1711 | 大餐计数 | | [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) | 🟠 | [🀄️](https://leetcode.cn/problems/count-good-meals) [🔗](https://leetcode.com/problems/count-good-meals) |

‎problem/0053.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -240,7 +240,7 @@ function maxCrossingSum(nums, low, mid, high) {
240240
| :------: | :------ | :------: | :------ | :------: | :------: |
241241
| 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) |
242242
| 152 | 乘积最大子数组 | [[✓]](/problem/0152.md) | [`数组`](/tag/array.md) [`动态规划`](/tag/dynamic-programming.md) | 🟠 | [🀄️](https://leetcode.cn/problems/maximum-product-subarray) [🔗](https://leetcode.com/problems/maximum-product-subarray) |
243-
| 697 | 数组的度 | | [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) | 🟢 | [🀄️](https://leetcode.cn/problems/degree-of-an-array) [🔗](https://leetcode.com/problems/degree-of-an-array) |
243+
| 697 | 数组的度 | [[✓]](/problem/0697.md) | [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) | 🟢 | [🀄️](https://leetcode.cn/problems/degree-of-an-array) [🔗](https://leetcode.com/problems/degree-of-an-array) |
244244
| 978 | 最长湍流子数组 | | [`数组`](/tag/array.md) [`动态规划`](/tag/dynamic-programming.md) [`滑动窗口`](/tag/sliding-window.md) | 🟠 | [🀄️](https://leetcode.cn/problems/longest-turbulent-subarray) [🔗](https://leetcode.com/problems/longest-turbulent-subarray) |
245245
| 1746 | 经过一次操作后的最大子数组和 🔒 | | [`数组`](/tag/array.md) [`动态规划`](/tag/dynamic-programming.md) | 🟠 | [🀄️](https://leetcode.cn/problems/maximum-subarray-sum-after-one-operation) [🔗](https://leetcode.com/problems/maximum-subarray-sum-after-one-operation) |
246246
| 1749 | 任意子数组和的绝对值的最大值 | | [`数组`](/tag/array.md) [`动态规划`](/tag/dynamic-programming.md) | 🟠 | [🀄️](https://leetcode.cn/problems/maximum-absolute-sum-of-any-subarray) [🔗](https://leetcode.com/problems/maximum-absolute-sum-of-any-subarray) |

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /