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 ebea3a1

Browse files
committed
Deploying to main from @ 364c232 🚀
1 parent fe9383b commit ebea3a1

Some content is hidden

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

76 files changed

+4205
-89
lines changed

‎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
@@ -98,7 +98,7 @@ var twoSum = function (nums, target) {
9898
| 1711 | 大餐计数 | | [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) | 🟠 | [🀄️](https://leetcode.cn/problems/count-good-meals) [🔗](https://leetcode.com/problems/count-good-meals) |
9999
| 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) |
101-
| 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) |
101+
| 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) |
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) |
103103
| 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) |
104104
| 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) |

‎problem/0007.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -108,5 +108,5 @@ var reverse = function (x) {
108108
| :------: | :------ | :------: | :------ | :------: | :------: |
109109
| 8 | 字符串转换整数 (atoi) | [[✓]](/problem/0008.md) | [`字符串`](/tag/string.md) | 🟠 | [🀄️](https://leetcode.cn/problems/string-to-integer-atoi) [🔗](https://leetcode.com/problems/string-to-integer-atoi) |
110110
| 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) |
111-
| 2119 | 反转两次的数字 | | [`数学`](/tag/math.md) | 🟢 | [🀄️](https://leetcode.cn/problems/a-number-after-a-double-reversal) [🔗](https://leetcode.com/problems/a-number-after-a-double-reversal) |
111+
| 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) |
112112
| 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) |

‎problem/0034.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -142,4 +142,4 @@ var searchRange = function (nums, target) {
142142
| :------: | :------ | :------: | :------ | :------: | :------: |
143143
| 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) |
144144
| 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) |
145-
| 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) |
145+
| 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) |

‎problem/0036.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -159,4 +159,4 @@ var isValidSudoku = function (board) {
159159
| 题号 | 标题 | 题解 | 标签 | 难度 | 力扣 |
160160
| :------: | :------ | :------: | :------ | :------: | :------: |
161161
| 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) |
162-
| 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) |
162+
| 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) |

‎problem/0068.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -192,5 +192,5 @@ var mergeWords = function (words, space) {
192192
| 题号 | 标题 | 题解 | 标签 | 难度 | 力扣 |
193193
| :------: | :------ | :------: | :------ | :------: | :------: |
194194
| 1592 | 重新排列单词间的空格 | [[✓]](/problem/1592.md) | [`字符串`](/tag/string.md) | 🟢 | [🀄️](https://leetcode.cn/problems/rearrange-spaces-between-words) [🔗](https://leetcode.com/problems/rearrange-spaces-between-words) |
195-
| 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) |
195+
| 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) |
196196
| 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) |

‎problem/0123.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -222,6 +222,6 @@ var maxProfit = function (prices) {
222222
| 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) |
223223
| 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) |
224224
| 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) |
225-
| 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) |
225+
| 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) |
226226
| 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) |
227227
| 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) |

‎problem/0125.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -135,6 +135,6 @@ var isChar = function (i) {
135135
| 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) |
136136
| 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) |
137137
| 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) |
138-
| 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) |
138+
| 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) |
139139
| 2330 | 验证回文串 IV 🔒 | | [`双指针`](/tag/two-pointers.md) [`字符串`](/tag/string.md) | 🟠 | [🀄️](https://leetcode.cn/problems/valid-palindrome-iv) [🔗](https://leetcode.com/problems/valid-palindrome-iv) |
140140
| 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) |

‎problem/0168.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -142,4 +142,4 @@ var convertToTitle = function (columnNumber) {
142142
| 题号 | 标题 | 题解 | 标签 | 难度 | 力扣 |
143143
| :------: | :------ | :------: | :------ | :------: | :------: |
144144
| 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) |
145-
| 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) |
145+
| 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) |

‎problem/0171.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -130,4 +130,4 @@ var titleToNumber = function (columnTitle) {
130130
| 题号 | 标题 | 题解 | 标签 | 难度 | 力扣 |
131131
| :------: | :------ | :------: | :------ | :------: | :------: |
132132
| 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) |
133-
| 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) |
133+
| 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) |

0 commit comments

Comments
(0)

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