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 fe9383b

Browse files
committed
Deploying to main from @ 2xiao/leetcode-js@c06e0da 🚀
1 parent d411b8a commit fe9383b

Some content is hidden

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

67 files changed

+4437
-74
lines changed

‎book/dynamic_programming.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -197,7 +197,7 @@
197197
| :------: | :------ | :------: | :------ | :------: | :------: |
198198
| 474 | 一和零 | [[✓]](/problem/0474.md) | [`数组`](/tag/array.md) [`字符串`](/tag/string.md) [`动态规划`](/tag/dynamic-programming.md) | 🟠 | [🀄️](https://leetcode.cn/problems/ones-and-zeroes) [🔗](https://leetcode.com/problems/ones-and-zeroes) |
199199
| 879 | 盈利计划 | | [`数组`](/tag/array.md) [`动态规划`](/tag/dynamic-programming.md) | 🔴 | [🀄️](https://leetcode.cn/problems/profitable-schemes) [🔗](https://leetcode.com/problems/profitable-schemes) |
200-
| 1995 | 统计特殊四元组 | | [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) [`枚举`](/tag/enumeration.md) | 🟢 | [🀄️](https://leetcode.cn/problems/count-special-quadruplets) [🔗](https://leetcode.com/problems/count-special-quadruplets) |
200+
| 1995 | 统计特殊四元组 | [[✓]](/problem/1995.md) | [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) [`枚举`](/tag/enumeration.md) | 🟢 | [🀄️](https://leetcode.cn/problems/count-special-quadruplets) [🔗](https://leetcode.com/problems/count-special-quadruplets) |
201201

202202
#### 区间 DP
203203

‎plan/contest_list.md

Lines changed: 24 additions & 24 deletions
Large diffs are not rendered by default.

‎problem/0001.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -96,7 +96,7 @@ var twoSum = function (nums, target) {
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) |
99-
| 2006 | 差的绝对值为 K 的数对数目 | | [`数组`](/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) |
99+
| 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) |
100100
| 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) |
101101
| 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) |
102102
| 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) |

‎problem/0008.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -166,4 +166,4 @@ var myAtoi = function (s) {
166166
| :------: | :------ | :------: | :------ | :------: | :------: |
167167
| 7 | 整数反转 | [[✓]](/problem/0007.md) | [`数学`](/tag/math.md) | 🟠 | [🀄️](https://leetcode.cn/problems/reverse-integer) [🔗](https://leetcode.com/problems/reverse-integer) |
168168
| 65 | 有效数字 | | [`字符串`](/tag/string.md) | 🔴 | [🀄️](https://leetcode.cn/problems/valid-number) [🔗](https://leetcode.com/problems/valid-number) |
169-
| 2042 | 检查句子中的数字是否递增 | | [`字符串`](/tag/string.md) | 🟢 | [🀄️](https://leetcode.cn/problems/check-if-numbers-are-ascending-in-a-sentence) [🔗](https://leetcode.com/problems/check-if-numbers-are-ascending-in-a-sentence) |
169+
| 2042 | 检查句子中的数字是否递增 | [[✓]](/problem/2042.md) | [`字符串`](/tag/string.md) | 🟢 | [🀄️](https://leetcode.cn/problems/check-if-numbers-are-ascending-in-a-sentence) [🔗](https://leetcode.com/problems/check-if-numbers-are-ascending-in-a-sentence) |

‎problem/0018.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -102,4 +102,4 @@ var fourSum = function (nums, target) {
102102
| 1 | 两数之和 | [[✓]](/problem/0001.md) | [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) | 🟢 | [🀄️](https://leetcode.cn/problems/two-sum) [🔗](https://leetcode.com/problems/two-sum) |
103103
| 15 | 三数之和 | [[✓]](/problem/0015.md) | [`数组`](/tag/array.md) [`双指针`](/tag/two-pointers.md) [`排序`](/tag/sorting.md) | 🟠 | [🀄️](https://leetcode.cn/problems/3sum) [🔗](https://leetcode.com/problems/3sum) |
104104
| 454 | 四数相加 II | | [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) | 🟠 | [🀄️](https://leetcode.cn/problems/4sum-ii) [🔗](https://leetcode.com/problems/4sum-ii) |
105-
| 1995 | 统计特殊四元组 | | [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) [`枚举`](/tag/enumeration.md) | 🟢 | [🀄️](https://leetcode.cn/problems/count-special-quadruplets) [🔗](https://leetcode.com/problems/count-special-quadruplets) |
105+
| 1995 | 统计特殊四元组 | [[✓]](/problem/1995.md) | [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) [`枚举`](/tag/enumeration.md) | 🟢 | [🀄️](https://leetcode.cn/problems/count-special-quadruplets) [🔗](https://leetcode.com/problems/count-special-quadruplets) |

‎problem/0121.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -175,5 +175,5 @@ var maxProfit = function (prices) {
175175
| 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) |
176176
| 309 | 买卖股票的最佳时机含冷冻期 | [[✓]](/problem/0309.md) | [`数组`](/tag/array.md) [`动态规划`](/tag/dynamic-programming.md) | 🟠 | [🀄️](https://leetcode.cn/problems/best-time-to-buy-and-sell-stock-with-cooldown) [🔗](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-cooldown) |
177177
| 2012 | 数组美丽值求和 | | [`数组`](/tag/array.md) | 🟠 | [🀄️](https://leetcode.cn/problems/sum-of-beauty-in-the-array) [🔗](https://leetcode.com/problems/sum-of-beauty-in-the-array) |
178-
| 2016 | 增量元素之间的最大差值 | | [`数组`](/tag/array.md) | 🟢 | [🀄️](https://leetcode.cn/problems/maximum-difference-between-increasing-elements) [🔗](https://leetcode.com/problems/maximum-difference-between-increasing-elements) |
178+
| 2016 | 增量元素之间的最大差值 | [[✓]](/problem/2016.md) | [`数组`](/tag/array.md) | 🟢 | [🀄️](https://leetcode.cn/problems/maximum-difference-between-increasing-elements) [🔗](https://leetcode.com/problems/maximum-difference-between-increasing-elements) |
179179
| 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) |

‎problem/0334.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -141,6 +141,6 @@ var increasingTriplet = function (nums) {
141141
| 题号 | 标题 | 题解 | 标签 | 难度 | 力扣 |
142142
| :------: | :------ | :------: | :------ | :------: | :------: |
143143
| 300 | 最长递增子序列 | [[✓]](/problem/0300.md) | [`数组`](/tag/array.md) [`二分查找`](/tag/binary-search.md) [`动态规划`](/tag/dynamic-programming.md) | 🟠 | [🀄️](https://leetcode.cn/problems/longest-increasing-subsequence) [🔗](https://leetcode.com/problems/longest-increasing-subsequence) |
144-
| 1995 | 统计特殊四元组 | | [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) [`枚举`](/tag/enumeration.md) | 🟢 | [🀄️](https://leetcode.cn/problems/count-special-quadruplets) [🔗](https://leetcode.com/problems/count-special-quadruplets) |
144+
| 1995 | 统计特殊四元组 | [[✓]](/problem/1995.md) | [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) [`枚举`](/tag/enumeration.md) | 🟢 | [🀄️](https://leetcode.cn/problems/count-special-quadruplets) [🔗](https://leetcode.com/problems/count-special-quadruplets) |
145145
| 2179 | 统计数组中好三元组数目 | | [`树状数组`](/tag/binary-indexed-tree.md) [`线段树`](/tag/segment-tree.md) [`数组`](/tag/array.md) `4+` | 🔴 | [🀄️](https://leetcode.cn/problems/count-good-triplets-in-an-array) [🔗](https://leetcode.com/problems/count-good-triplets-in-an-array) |
146146
| 2552 | 统计上升四元组 | | [`树状数组`](/tag/binary-indexed-tree.md) [`数组`](/tag/array.md) [`动态规划`](/tag/dynamic-programming.md) `2+` | 🔴 | [🀄️](https://leetcode.cn/problems/count-increasing-quadruplets) [🔗](https://leetcode.com/problems/count-increasing-quadruplets) |

‎problem/0349.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -109,7 +109,7 @@ var intersection = function (nums1, nums2) {
109109
| :------: | :------ | :------: | :------ | :------: | :------: |
110110
| 350 | 两个数组的交集 II | [[✓]](/problem/0350.md) | [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) [`双指针`](/tag/two-pointers.md) `2+` | 🟢 | [🀄️](https://leetcode.cn/problems/intersection-of-two-arrays-ii) [🔗](https://leetcode.com/problems/intersection-of-two-arrays-ii) |
111111
| 1213 | 三个有序数组的交集 🔒 | | [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) [`二分查找`](/tag/binary-search.md) `1+` | 🟢 | [🀄️](https://leetcode.cn/problems/intersection-of-three-sorted-arrays) [🔗](https://leetcode.com/problems/intersection-of-three-sorted-arrays) |
112-
| 2085 | 统计出现过一次的公共字符串 | | [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) [`字符串`](/tag/string.md) `1+` | 🟢 | [🀄️](https://leetcode.cn/problems/count-common-words-with-one-occurrence) [🔗](https://leetcode.com/problems/count-common-words-with-one-occurrence) |
112+
| 2085 | 统计出现过一次的公共字符串 | [[✓]](/problem/2085.md) | [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) [`字符串`](/tag/string.md) `1+` | 🟢 | [🀄️](https://leetcode.cn/problems/count-common-words-with-one-occurrence) [🔗](https://leetcode.com/problems/count-common-words-with-one-occurrence) |
113113
| 2143 | 在两个数组的区间中选取数字 🔒 | | [`数组`](/tag/array.md) [`动态规划`](/tag/dynamic-programming.md) | 🔴 | [🀄️](https://leetcode.cn/problems/choose-numbers-from-two-arrays-in-range) [🔗](https://leetcode.com/problems/choose-numbers-from-two-arrays-in-range) |
114114
| 2215 | 找出两数组的不同 | [[✓]](/problem/2215.md) | [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) | 🟢 | [🀄️](https://leetcode.cn/problems/find-the-difference-of-two-arrays) [🔗](https://leetcode.com/problems/find-the-difference-of-two-arrays) |
115115
| 2248 | 多个数组求交集 | | [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) [`计数`](/tag/counting.md) `1+` | 🟢 | [🀄️](https://leetcode.cn/problems/intersection-of-multiple-arrays) [🔗](https://leetcode.com/problems/intersection-of-multiple-arrays) |

‎problem/0561.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -134,6 +134,6 @@ var arrayPairSum = function (nums) {
134134
<!-- prettier-ignore -->
135135
| 题号 | 标题 | 题解 | 标签 | 难度 | 力扣 |
136136
| :------: | :------ | :------: | :------ | :------: | :------: |
137-
| 1984 | 学生分数的最小差值 | | [`数组`](/tag/array.md) [`排序`](/tag/sorting.md) [`滑动窗口`](/tag/sliding-window.md) | 🟢 | [🀄️](https://leetcode.cn/problems/minimum-difference-between-highest-and-lowest-of-k-scores) [🔗](https://leetcode.com/problems/minimum-difference-between-highest-and-lowest-of-k-scores) |
137+
| 1984 | 学生分数的最小差值 | [[✓]](/problem/1984.md) | [`数组`](/tag/array.md) [`排序`](/tag/sorting.md) [`滑动窗口`](/tag/sliding-window.md) | 🟢 | [🀄️](https://leetcode.cn/problems/minimum-difference-between-highest-and-lowest-of-k-scores) [🔗](https://leetcode.com/problems/minimum-difference-between-highest-and-lowest-of-k-scores) |
138138
| 2144 | 打折购买糖果的最小开销 | | [`贪心`](/tag/greedy.md) [`数组`](/tag/array.md) [`排序`](/tag/sorting.md) | 🟢 | [🀄️](https://leetcode.cn/problems/minimum-cost-of-buying-candies-with-discount) [🔗](https://leetcode.com/problems/minimum-cost-of-buying-candies-with-discount) |
139139
| 2155 | 分组得分最高的所有下标 | | [`数组`](/tag/array.md) | 🟠 | [🀄️](https://leetcode.cn/problems/all-divisions-with-the-highest-score-of-a-binary-array) [🔗](https://leetcode.com/problems/all-divisions-with-the-highest-score-of-a-binary-array) |

‎problem/0566.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -154,4 +154,4 @@ var matrixReshape = function (mat, r, c) {
154154
<!-- prettier-ignore -->
155155
| 题号 | 标题 | 题解 | 标签 | 难度 | 力扣 |
156156
| :------: | :------ | :------: | :------ | :------: | :------: |
157-
| 2022 | 将一维数组转变成二维数组 | | [`数组`](/tag/array.md) [`矩阵`](/tag/matrix.md) [`模拟`](/tag/simulation.md) | 🟢 | [🀄️](https://leetcode.cn/problems/convert-1d-array-into-2d-array) [🔗](https://leetcode.com/problems/convert-1d-array-into-2d-array) |
157+
| 2022 | 将一维数组转变成二维数组 | [[✓]](/problem/2022.md) | [`数组`](/tag/array.md) [`矩阵`](/tag/matrix.md) [`模拟`](/tag/simulation.md) | 🟢 | [🀄️](https://leetcode.cn/problems/convert-1d-array-into-2d-array) [🔗](https://leetcode.com/problems/convert-1d-array-into-2d-array) |

0 commit comments

Comments
(0)

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