Skip to content

Commit ae3ffe7

Browse files
2xiao2xiao
committed
fix easy bug
1 parent 0dac30d commit ae3ffe7

File tree

190 files changed

+14628
-14911
lines changed

Some content is hidden

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

190 files changed

+14628
-14911
lines changed

‎assets/scripts/generate.py

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -175,7 +175,7 @@ def gen_tag_and_difficulty():
175175
continue
176176
if "<font color=#ffb800>Medium</font>" in content:
177177
continue
178-
if "<font color=#15bd66>Esay</font>" in content:
178+
if "<font color=#15bd66>Easy</font>" in content:
179179
continue
180180

181181
content, after = content.split(delim)

‎assets/scripts/utils.py

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -62,7 +62,7 @@ def format_difficulty(difficulty: str, show_emoji: bool = False):
6262
font = "<font color=#ffb800>Medium</font>"
6363
elif difficulty == "简单":
6464
emoji = "🟢"
65-
font = "<font color=#15bd66>Esay</font>"
65+
font = "<font color=#15bd66>Easy</font>"
6666
if show_emoji:
6767
return emoji + " " + font
6868
return font

‎src/leetcode/algorithm/binary_search.md

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

‎src/leetcode/algorithm/bit.md

Lines changed: 19 additions & 21 deletions
Original file line numberDiff line numberDiff line change
@@ -4,26 +4,24 @@
44
<!-- Please keep comment here to allow auto update -->
55
<!-- DON'T EDIT THIS SECTION, INSTEAD RE-RUN `npm run lc` TO UPDATE -->
66

7-
87
## 相关题目
98

10-
| 题号 | 标题 | 题解 | 标签 | 难度 |
11-
| :------: | :------ | :------: | :------ | :------ |
12-
| 0504 | [七进制数](https://leetcode.com/problems/base-7/) | | [`数学`](/leetcode/outline/tag/mathematics.md) | <font color=#15bd66>Esay</font> |
13-
| 0405 | [数字转换为十六进制数](https://leetcode.com/problems/convert-a-number-to-hexadecimal/) | | [`位运算`](/leetcode/outline/tag/bit-manipulation.md) [`数学`](/leetcode/outline/tag/mathematics.md) | <font color=#15bd66>Esay</font> |
14-
| 0190 | [颠倒二进制位](https://leetcode.com/problems/reverse-bits/) | | [`位运算`](/leetcode/outline/tag/bit-manipulation.md) [`分治`](/leetcode/outline/tag/divide-and-conquer.md) | <font color=#15bd66>Esay</font> |
15-
| 1009 | [十进制整数的反码](https://leetcode.com/problems/complement-of-base-10-integer/) | | [`位运算`](/leetcode/outline/tag/bit-manipulation.md) | <font color=#15bd66>Esay</font> |
16-
| 0191 | [位1的个数](https://leetcode.com/problems/number-of-1-bits/) | [JS](https://2xiao.github.io/leetcode-js/leetcode/problem/0191) | [`位运算`](/leetcode/outline/tag/bit-manipulation.md) [`分治`](/leetcode/outline/tag/divide-and-conquer.md) | <font color=#15bd66>Esay</font> |
17-
| 0371 | [两整数之和](https://leetcode.com/problems/sum-of-two-integers/) | | [`位运算`](/leetcode/outline/tag/bit-manipulation.md) [`数学`](/leetcode/outline/tag/mathematics.md) | <font color=#ffb800>Medium</font> |
18-
| 0089 | [格雷编码](https://leetcode.com/problems/gray-code/) | | [`位运算`](/leetcode/outline/tag/bit-manipulation.md) [`数学`](/leetcode/outline/tag/mathematics.md) [`回溯`](/leetcode/outline/tag/backtracking.md) | <font color=#ffb800>Medium</font> |
19-
| 0201 | [数字范围按位与](https://leetcode.com/problems/bitwise-and-of-numbers-range/) | | [`位运算`](/leetcode/outline/tag/bit-manipulation.md) | <font color=#ffb800>Medium</font> |
20-
| 0338 | [比特位计数](https://leetcode.com/problems/counting-bits/) | | [`位运算`](/leetcode/outline/tag/bit-manipulation.md) [`动态规划`](/leetcode/outline/tag/dynamic-programming.md) | <font color=#15bd66>Esay</font> |
21-
| 0136 | [只出现一次的数字](https://leetcode.com/problems/single-number/) | [JS](https://2xiao.github.io/leetcode-js/leetcode/problem/0136) | [`位运算`](/leetcode/outline/tag/bit-manipulation.md) [`数组`](/leetcode/outline/tag/array.md) | <font color=#15bd66>Esay</font> |
22-
| 0137 | [只出现一次的数字 II](https://leetcode.com/problems/single-number-ii/) | | [`位运算`](/leetcode/outline/tag/bit-manipulation.md) [`数组`](/leetcode/outline/tag/array.md) | <font color=#ffb800>Medium</font> |
23-
| 0260 | [只出现一次的数字 III](https://leetcode.com/problems/single-number-iii/) | | [`位运算`](/leetcode/outline/tag/bit-manipulation.md) [`数组`](/leetcode/outline/tag/array.md) | <font color=#ffb800>Medium</font> |
24-
| 0268 | [丢失的数字](https://leetcode.com/problems/missing-number/) | [JS](https://2xiao.github.io/leetcode-js/leetcode/problem/0268) | [`位运算`](/leetcode/outline/tag/bit-manipulation.md) [`数组`](/leetcode/outline/tag/array.md) [`哈希表`](/leetcode/outline/tag/hash-table.md) `3+` | <font color=#15bd66>Esay</font> |
25-
| 1349 | [参加考试的最大学生数](https://leetcode.com/problems/maximum-students-taking-exam/) | | [`位运算`](/leetcode/outline/tag/bit-manipulation.md) [`数组`](/leetcode/outline/tag/array.md) [`动态规划`](/leetcode/outline/tag/dynamic-programming.md) `2+` | <font color=#ff334b>Hard</font> |
26-
| 0645 | [错误的集合](https://leetcode.com/problems/set-mismatch/) | | [`位运算`](/leetcode/outline/tag/bit-manipulation.md) [`数组`](/leetcode/outline/tag/array.md) [`哈希表`](/leetcode/outline/tag/hash-table.md) `1+` | <font color=#15bd66>Esay</font> |
27-
| 0078 | [子集](https://leetcode.com/problems/subsets/) | [JS](https://2xiao.github.io/leetcode-js/leetcode/problem/0078) | [`位运算`](/leetcode/outline/tag/bit-manipulation.md) [`数组`](/leetcode/outline/tag/array.md) [`回溯`](/leetcode/outline/tag/backtracking.md) | <font color=#ffb800>Medium</font> |
28-
| 0090 | [子集 II](https://leetcode.com/problems/subsets-ii/) | [JS](https://2xiao.github.io/leetcode-js/leetcode/problem/0090) | [`位运算`](/leetcode/outline/tag/bit-manipulation.md) [`数组`](/leetcode/outline/tag/array.md) [`回溯`](/leetcode/outline/tag/backtracking.md) | <font color=#ffb800>Medium</font> |
29-
9+
| 题号 | 标题 | 题解 | 标签 | 难度 |
10+
| :--: | :------------------------------------------------------------------------------------- | :-------------------------------------------------------------: | :------------------------------------------------------------------------------------------------------------------------------------------------------------- | :-------------------------------- |
11+
| 0504 | [七进制数](https://leetcode.com/problems/base-7/) | | [`数学`](/leetcode/outline/tag/mathematics.md) | <font color=#15bd66>Easy</font> |
12+
| 0405 | [数字转换为十六进制数](https://leetcode.com/problems/convert-a-number-to-hexadecimal/) | | [`位运算`](/leetcode/outline/tag/bit-manipulation.md) [`数学`](/leetcode/outline/tag/mathematics.md) | <font color=#15bd66>Easy</font> |
13+
| 0190 | [颠倒二进制位](https://leetcode.com/problems/reverse-bits/) | | [`位运算`](/leetcode/outline/tag/bit-manipulation.md) [`分治`](/leetcode/outline/tag/divide-and-conquer.md) | <font color=#15bd66>Easy</font> |
14+
| 1009 | [十进制整数的反码](https://leetcode.com/problems/complement-of-base-10-integer/) | | [`位运算`](/leetcode/outline/tag/bit-manipulation.md) | <font color=#15bd66>Easy</font> |
15+
| 0191 | [位 1 的个数](https://leetcode.com/problems/number-of-1-bits/) | [JS](https://2xiao.github.io/leetcode-js/leetcode/problem/0191) | [`位运算`](/leetcode/outline/tag/bit-manipulation.md) [`分治`](/leetcode/outline/tag/divide-and-conquer.md) | <font color=#15bd66>Easy</font> |
16+
| 0371 | [两整数之和](https://leetcode.com/problems/sum-of-two-integers/) | | [`位运算`](/leetcode/outline/tag/bit-manipulation.md) [`数学`](/leetcode/outline/tag/mathematics.md) | <font color=#ffb800>Medium</font> |
17+
| 0089 | [格雷编码](https://leetcode.com/problems/gray-code/) | | [`位运算`](/leetcode/outline/tag/bit-manipulation.md) [`数学`](/leetcode/outline/tag/mathematics.md) [`回溯`](/leetcode/outline/tag/backtracking.md) | <font color=#ffb800>Medium</font> |
18+
| 0201 | [数字范围按位与](https://leetcode.com/problems/bitwise-and-of-numbers-range/) | | [`位运算`](/leetcode/outline/tag/bit-manipulation.md) | <font color=#ffb800>Medium</font> |
19+
| 0338 | [比特位计数](https://leetcode.com/problems/counting-bits/) | | [`位运算`](/leetcode/outline/tag/bit-manipulation.md) [`动态规划`](/leetcode/outline/tag/dynamic-programming.md) | <font color=#15bd66>Easy</font> |
20+
| 0136 | [只出现一次的数字](https://leetcode.com/problems/single-number/) | [JS](https://2xiao.github.io/leetcode-js/leetcode/problem/0136) | [`位运算`](/leetcode/outline/tag/bit-manipulation.md) [`数组`](/leetcode/outline/tag/array.md) | <font color=#15bd66>Easy</font> |
21+
| 0137 | [只出现一次的数字 II](https://leetcode.com/problems/single-number-ii/) | | [`位运算`](/leetcode/outline/tag/bit-manipulation.md) [`数组`](/leetcode/outline/tag/array.md) | <font color=#ffb800>Medium</font> |
22+
| 0260 | [只出现一次的数字 III](https://leetcode.com/problems/single-number-iii/) | | [`位运算`](/leetcode/outline/tag/bit-manipulation.md) [`数组`](/leetcode/outline/tag/array.md) | <font color=#ffb800>Medium</font> |
23+
| 0268 | [丢失的数字](https://leetcode.com/problems/missing-number/) | [JS](https://2xiao.github.io/leetcode-js/leetcode/problem/0268) | [`位运算`](/leetcode/outline/tag/bit-manipulation.md) [`数组`](/leetcode/outline/tag/array.md) [`哈希表`](/leetcode/outline/tag/hash-table.md) `3+` | <font color=#15bd66>Easy</font> |
24+
| 1349 | [参加考试的最大学生数](https://leetcode.com/problems/maximum-students-taking-exam/) | | [`位运算`](/leetcode/outline/tag/bit-manipulation.md) [`数组`](/leetcode/outline/tag/array.md) [`动态规划`](/leetcode/outline/tag/dynamic-programming.md) `2+` | <font color=#ff334b>Hard</font> |
25+
| 0645 | [错误的集合](https://leetcode.com/problems/set-mismatch/) | | [`位运算`](/leetcode/outline/tag/bit-manipulation.md) [`数组`](/leetcode/outline/tag/array.md) [`哈希表`](/leetcode/outline/tag/hash-table.md) `1+` | <font color=#15bd66>Easy</font> |
26+
| 0078 | [子集](https://leetcode.com/problems/subsets/) | [JS](https://2xiao.github.io/leetcode-js/leetcode/problem/0078) | [`位运算`](/leetcode/outline/tag/bit-manipulation.md) [`数组`](/leetcode/outline/tag/array.md) [`回溯`](/leetcode/outline/tag/backtracking.md) | <font color=#ffb800>Medium</font> |
27+
| 0090 | [子集 II](https://leetcode.com/problems/subsets-ii/) | [JS](https://2xiao.github.io/leetcode-js/leetcode/problem/0090) | [`位运算`](/leetcode/outline/tag/bit-manipulation.md) [`数组`](/leetcode/outline/tag/array.md) [`回溯`](/leetcode/outline/tag/backtracking.md) | <font color=#ffb800>Medium</font> |

‎src/leetcode/algorithm/divide_conquer.md

Lines changed: 10 additions & 13 deletions
Original file line numberDiff line numberDiff line change
@@ -1,21 +1,18 @@
11
# 3.3 分治算法
22

3-
43
<!-- START TABLE -->
54
<!-- Please keep comment here to allow auto update -->
65
<!-- DON'T EDIT THIS SECTION, INSTEAD RE-RUN `npm run lc` TO UPDATE -->
76

8-
97
## 相关题目
108

11-
| 题号 | 标题 | 题解 | 标签 | 难度 |
12-
| :------: | :------ | :------: | :------ | :------ |
13-
| 0004 | [寻找两个正序数组的中位数](https://leetcode.com/problems/median-of-two-sorted-arrays/) | [JS](https://2xiao.github.io/leetcode-js/leetcode/problem/0004) | [`数组`](/leetcode/outline/tag/array.md) [`二分查找`](/leetcode/outline/tag/binary-search.md) [`分治`](/leetcode/outline/tag/divide-and-conquer.md) | <font color=#ff334b>Hard</font> |
14-
| 0023 | [合并 K 个升序链表](https://leetcode.com/problems/merge-k-sorted-lists/) | [JS](https://2xiao.github.io/leetcode-js/leetcode/problem/0023) | [`链表`](/leetcode/outline/tag/linked-list.md) [`分治`](/leetcode/outline/tag/divide-and-conquer.md) [`堆（优先队列）`](/leetcode/outline/tag/heap-priority-queue.md) `1+` | <font color=#ff334b>Hard</font> |
15-
| 0053 | [最大子数组和](https://leetcode.com/problems/maximum-subarray/) | [JS](https://2xiao.github.io/leetcode-js/leetcode/problem/0053) | [`数组`](/leetcode/outline/tag/array.md) [`分治`](/leetcode/outline/tag/divide-and-conquer.md) [`动态规划`](/leetcode/outline/tag/dynamic-programming.md) | <font color=#ffb800>Medium</font> |
16-
| 0241 | [为运算表达式设计优先级](https://leetcode.com/problems/different-ways-to-add-parentheses/) | | [`递归`](/leetcode/outline/tag/recursion.md) [`记忆化搜索`](/leetcode/outline/tag/memoization.md) [`数学`](/leetcode/outline/tag/mathematics.md) `2+` | <font color=#ffb800>Medium</font> |
17-
| 0169 | [多数元素](https://leetcode.com/problems/majority-element/) | [JS](https://2xiao.github.io/leetcode-js/leetcode/problem/0169) | [`数组`](/leetcode/outline/tag/array.md) [`哈希表`](/leetcode/outline/tag/hash-table.md) [`分治`](/leetcode/outline/tag/divide-and-conquer.md) `2+` | <font color=#15bd66>Esay</font> |
18-
| 0050 | [Pow(x, n)](https://leetcode.com/problems/powx-n/) | [JS](https://2xiao.github.io/leetcode-js/leetcode/problem/0050) | [`递归`](/leetcode/outline/tag/recursion.md) [`数学`](/leetcode/outline/tag/mathematics.md) | <font color=#ffb800>Medium</font> |
19-
| 0014 | [最长公共前缀](https://leetcode.com/problems/longest-common-prefix/) | [JS](https://2xiao.github.io/leetcode-js/leetcode/problem/0014) | [`字典树`](/leetcode/outline/tag/trie.md) [`字符串`](/leetcode/outline/tag/string.md) | <font color=#15bd66>Esay</font> |
20-
| 剑指 Offer 33 | [二叉搜索树的后序遍历序列](https://leetcode.cn/problems/er-cha-sou-suo-shu-de-hou-xu-bian-li-xu-lie-lcof/) | [JS](https://2xiao.github.io/leetcode-js/leetcode/problem/jz_offer_33_1) | [`栈`](/leetcode/outline/tag/stack.md) [`树`](/leetcode/outline/tag/tree.md) [`二叉搜索树`](/leetcode/outline/tag/binary-search-tree.md) `3+` | <font color=#ffb800>Medium</font> |
21-
9+
| 题号 | 标题 | 题解 | 标签 | 难度 |
10+
| :-----------: | :--------------------------------------------------------------------------------------------------------- | :----------------------------------------------------------------------: | :------------------------------------------------------------------------------------------------------------------------------------------------------------------------- | :-------------------------------- |
11+
| 0004 | [寻找两个正序数组的中位数](https://leetcode.com/problems/median-of-two-sorted-arrays/) | [JS](https://2xiao.github.io/leetcode-js/leetcode/problem/0004) | [`数组`](/leetcode/outline/tag/array.md) [`二分查找`](/leetcode/outline/tag/binary-search.md) [`分治`](/leetcode/outline/tag/divide-and-conquer.md) | <font color=#ff334b>Hard</font> |
12+
| 0023 | [合并 K 个升序链表](https://leetcode.com/problems/merge-k-sorted-lists/) | [JS](https://2xiao.github.io/leetcode-js/leetcode/problem/0023) | [`链表`](/leetcode/outline/tag/linked-list.md) [`分治`](/leetcode/outline/tag/divide-and-conquer.md) [`堆（优先队列）`](/leetcode/outline/tag/heap-priority-queue.md) `1+` | <font color=#ff334b>Hard</font> |
13+
| 0053 | [最大子数组和](https://leetcode.com/problems/maximum-subarray/) | [JS](https://2xiao.github.io/leetcode-js/leetcode/problem/0053) | [`数组`](/leetcode/outline/tag/array.md) [`分治`](/leetcode/outline/tag/divide-and-conquer.md) [`动态规划`](/leetcode/outline/tag/dynamic-programming.md) | <font color=#ffb800>Medium</font> |
14+
| 0241 | [为运算表达式设计优先级](https://leetcode.com/problems/different-ways-to-add-parentheses/) | | [`递归`](/leetcode/outline/tag/recursion.md) [`记忆化搜索`](/leetcode/outline/tag/memoization.md) [`数学`](/leetcode/outline/tag/mathematics.md) `2+` | <font color=#ffb800>Medium</font> |
15+
| 0169 | [多数元素](https://leetcode.com/problems/majority-element/) | [JS](https://2xiao.github.io/leetcode-js/leetcode/problem/0169) | [`数组`](/leetcode/outline/tag/array.md) [`哈希表`](/leetcode/outline/tag/hash-table.md) [`分治`](/leetcode/outline/tag/divide-and-conquer.md) `2+` | <font color=#15bd66>Easy</font> |
16+
| 0050 | [Pow(x, n)](https://leetcode.com/problems/powx-n/) | [JS](https://2xiao.github.io/leetcode-js/leetcode/problem/0050) | [`递归`](/leetcode/outline/tag/recursion.md) [`数学`](/leetcode/outline/tag/mathematics.md) | <font color=#ffb800>Medium</font> |
17+
| 0014 | [最长公共前缀](https://leetcode.com/problems/longest-common-prefix/) | [JS](https://2xiao.github.io/leetcode-js/leetcode/problem/0014) | [`字典树`](/leetcode/outline/tag/trie.md) [`字符串`](/leetcode/outline/tag/string.md) | <font color=#15bd66>Easy</font> |
18+
| 剑指 Offer 33 | [二叉搜索树的后序遍历序列](https://leetcode.cn/problems/er-cha-sou-suo-shu-de-hou-xu-bian-li-xu-lie-lcof/) | [JS](https://2xiao.github.io/leetcode-js/leetcode/problem/jz_offer_33_1) | [`栈`](/leetcode/outline/tag/stack.md) [`树`](/leetcode/outline/tag/tree.md) [`二叉搜索树`](/leetcode/outline/tag/binary-search-tree.md) `3+` | <font color=#ffb800>Medium</font> |

0 commit comments

Comments
 (0)