Skip to content

[pull] main from itcharge:main #205

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 1 commit into from
Jul 4, 2025
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
12 changes: 3 additions & 9 deletions docs/00_preface/00_04_leetcode_guide.md
Original file line number Diff line number Diff line change
Expand Up @@ -183,20 +183,14 @@ LeetCode 的题目序号并不是按照难易程度进行排序的,所以除

或者直接按照我整理的分类刷题列表进行刷题:

- 刷题列表(GitHub 版)链接:[点击打开「GitHub 版分类刷题列表」](https://github.com/ITCharge/AlgoNote/tree/main/Contents/00.Introduction/05.Categories-List.md)
- 刷题列表(网页版)链接:[点击打开「网页版分类刷题列表」](https://algo.itcharge.cn/00.Introduction/05.Categories-List/)
- LeetCode 分类刷题列表:[点击打开「LeetCode 分类刷题列表」](https://github.com/itcharge/AlgoNote/tree/main/docs/00_preface/00_06_categories_list.md)

正在准备面试、没有太多时间刷题的小伙伴,可以按照我总结的「LeetCode 面试最常考 100 题」、「LeetCode 面试最常考 200 题」进行刷题。

> **说明**:「LeetCode 面试最常考 100 题」、「LeetCode 面试最常考 200 题」是笔者根据「[CodeTop 企业题库](https://codetop.cc/home)」按频度从高到低进行筛选,并且去除了一部分 LeetCode 上没有的题目和重复题目后得到的题目清单。

- 「LeetCode 面试最常考 100 题(GitHub 版)」链接:[点击打开「LeetCode 面试最常考 100 题(GitHub 版)」](https://github.com/ITCharge/AlgoNote/tree/main/Contents/00.Introduction/06.Interview-100-List.md)
- 「LeetCode 面试最常考 200 题(GitHub 版)」链接:[点击打开「LeetCode 面试最常考 200 题(GitHub 版)」](https://github.com/ITCharge/AlgoNote/tree/main/Contents/00.Introduction/07.Interview-200-List.md)

---

- 「LeetCode 面试最常考 100 题(网页版)」链接:[点击打开「LeetCode 面试最常考 100 题(网页版)」](https://algo.itcharge.cn/00.Introduction/06.Interview-100-List/)
- 「LeetCode 面试最常考 200 题(网页版)」链接:[点击打开「LeetCode 面试最常考 200 题(网页版)」](https://algo.itcharge.cn/00.Introduction/07.Interview-200-List/)
- 「LeetCode 面试最常考 100 题:[点击打开「LeetCode 面试最常考 100 题」](https://github.com/itcharge/AlgoNote/tree/main/docs/00_preface/00_07_interview_100_list.md)
- 「LeetCode 面试最常考 200 题:[点击打开「LeetCode 面试最常考 200 题」](https://github.com/itcharge/AlgoNote/tree/main/docs/00_preface/00_08_interview_200_list.md)

### 3.3 LeetCode 刷题技巧

Expand Down
2 changes: 1 addition & 1 deletion docs/00_preface/00_07_interview_100_list.md
Original file line number Diff line number Diff line change
@@ -1,4 +1,4 @@
# LeetCode 面试最常考 200 题(按分类排序)
# LeetCode 面试最常考 100 题(按分类排序)

## 第 1 章 数组

Expand Down
2 changes: 1 addition & 1 deletion docs/01_array/01_06_array_shell_sort.md
Original file line number Diff line number Diff line change
Expand Up @@ -99,6 +99,6 @@ class Solution:
## 练习题目

- [0912. 排序数组](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/sort-an-array.md)
- [0506. 相对名次](https://github.com/itcharge/AlgoNote/blob/main/docs/solutions/0500-0599/relative-ranks.md)
- [0506. 相对名次](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0500-0599/relative-ranks.md)

- [排序算法题目列表](https://github.com/ITCharge/AlgoNote/tree/main/docs/00_preface/00_06_categories_list.md#%E6%8E%92%E5%BA%8F%E7%AE%97%E6%B3%95%E9%A2%98%E7%9B%AE)
6 changes: 3 additions & 3 deletions docs/01_array/01_07_array_merge_sort.md
Original file line number Diff line number Diff line change
Expand Up @@ -87,9 +87,9 @@ class Solution:


- [0912. 排序数组](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/sort-an-array.md)
- [0088. 合并两个有序数组](https://github.com/itcharge/AlgoNote/blob/main/docs/solutions/0001-0099/merge-sorted-array.md)
- [LCR 170. 交易逆序对的总数](https://github.com/itcharge/AlgoNote/blob/main/docs/solutions/LCR/shu-zu-zhong-de-ni-xu-dui-lcof.md)
- [0315. 计算右侧小于当前元素的个数](https://github.com/itcharge/AlgoNote/blob/main/docs/solutions/0300-0399/count-of-smaller-numbers-after-self.md)
- [0088. 合并两个有序数组](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/merge-sorted-array.md)
- [LCR 170. 交易逆序对的总数](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/shu-zu-zhong-de-ni-xu-dui-lcof.md)
- [0315. 计算右侧小于当前元素的个数](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/count-of-smaller-numbers-after-self.md)


- [排序算法题目列表](https://github.com/ITCharge/AlgoNote/tree/main/docs/00_preface/00_06_categories_list.md#%E6%8E%92%E5%BA%8F%E7%AE%97%E6%B3%95%E9%A2%98%E7%9B%AE)
2 changes: 1 addition & 1 deletion docs/01_array/01_08_array_quick_sort.md
Original file line number Diff line number Diff line change
Expand Up @@ -147,7 +147,7 @@ class Solution:
## 练习题目

- [0912. 排序数组](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/sort-an-array.md)
- [0169. 多数元素](https://github.com/itcharge/AlgoNote/blob/main/docs/solutions/0100-0199/majority-element.md)
- [0169. 多数元素](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/majority-element.md)

- [排序算法题目列表](https://github.com/ITCharge/AlgoNote/tree/main/docs/00_preface/00_06_categories_list.md#%E6%8E%92%E5%BA%8F%E7%AE%97%E6%B3%95%E9%A2%98%E7%9B%AE)

Expand Down
4 changes: 2 additions & 2 deletions docs/01_array/01_09_array_heap_sort.md
Original file line number Diff line number Diff line change
Expand Up @@ -381,7 +381,7 @@ print(Solution().sortArray([10, 25, 6, 8, 7, 1, 20, 23, 16, 19, 17, 3, 18, 14]))
## 练习题目

- [0912. 排序数组](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/sort-an-array.md)
- [0215. 数组中的第K个最大元素](https://github.com/itcharge/AlgoNote/blob/main/docs/solutions/0200-0299/kth-largest-element-in-an-array.md)
- [LCR 159. 库存管理 III](https://github.com/itcharge/AlgoNote/blob/main/docs/solutions/LCR/zui-xiao-de-kge-shu-lcof.md)
- [0215. 数组中的第K个最大元素](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/kth-largest-element-in-an-array.md)
- [LCR 159. 库存管理 III](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/zui-xiao-de-kge-shu-lcof.md)

- [排序算法题目列表](https://github.com/ITCharge/AlgoNote/tree/main/docs/00_preface/00_06_categories_list.md#%E6%8E%92%E5%BA%8F%E7%AE%97%E6%B3%95%E9%A2%98%E7%9B%AE)
2 changes: 1 addition & 1 deletion docs/01_array/01_10_array_counting_sort.md
Original file line number Diff line number Diff line change
Expand Up @@ -73,6 +73,6 @@ class Solution:
## 练习题目

- [0912. 排序数组](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/sort-an-array.md)
- [1122. 数组的相对排序](https://github.com/itcharge/AlgoNote/blob/main/docs/solutions/1100-1199/relative-sort-array.md)
- [1122. 数组的相对排序](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1100-1199/relative-sort-array.md)

- [排序算法题目列表](https://github.com/ITCharge/AlgoNote/tree/main/docs/00_preface/00_06_categories_list.md#%E6%8E%92%E5%BA%8F%E7%AE%97%E6%B3%95%E9%A2%98%E7%9B%AE)
4 changes: 2 additions & 2 deletions docs/01_array/01_11_array_bucket_sort.md
Original file line number Diff line number Diff line change
Expand Up @@ -76,7 +76,7 @@ class Solution:
## 练习题目

- [0912. 排序数组](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/sort-an-array.md)
- [0220. 存在重复元素 III](https://github.com/itcharge/AlgoNote/blob/main/docs/solutions/0200-0299/contains-duplicate-iii.md)
- [0164. 最大间距](https://github.com/itcharge/AlgoNote/blob/main/docs/solutions/0100-0199/maximum-gap.md)
- [0220. 存在重复元素 III](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/contains-duplicate-iii.md)
- [0164. 最大间距](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/maximum-gap.md)

- [排序算法题目列表](https://github.com/ITCharge/AlgoNote/tree/main/docs/00_preface/00_06_categories_list.md#%E6%8E%92%E5%BA%8F%E7%AE%97%E6%B3%95%E9%A2%98%E7%9B%AE)
4 changes: 2 additions & 2 deletions docs/01_array/01_12_array_radix_sort.md
Original file line number Diff line number Diff line change
Expand Up @@ -67,7 +67,7 @@ class Solution:
## 练习题目

- [0912. 排序数组](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/sort-an-array.md)
- [0164. 最大间距](https://github.com/itcharge/AlgoNote/blob/main/docs/solutions/0100-0199/maximum-gap.md)
- [0561. 数组拆分](https://github.com/itcharge/AlgoNote/blob/main/docs/solutions/0500-0599/array-partition.md)
- [0164. 最大间距](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/maximum-gap.md)
- [0561. 数组拆分](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0500-0599/array-partition.md)

- [排序算法题目列表](https://github.com/ITCharge/AlgoNote/tree/main/docs/00_preface/00_06_categories_list.md#%E6%8E%92%E5%BA%8F%E7%AE%97%E6%B3%95%E9%A2%98%E7%9B%AE)
8 changes: 4 additions & 4 deletions docs/01_array/01_13_array_binary_search_01.md
Original file line number Diff line number Diff line change
Expand Up @@ -158,9 +158,9 @@ class Solution:

## 练习题目

- [0704. 二分查找](https://github.com/itcharge/AlgoNote/blob/main/docs/solutions/0700-0799/binary-search.md)
- [0374. 猜数字大小](https://github.com/itcharge/AlgoNote/blob/main/docs/solutions/0300-0399/guess-number-higher-or-lower.md)
- [0035. 搜索插入位置](https://github.com/itcharge/AlgoNote/blob/main/docs/solutions/0001-0099/search-insert-position.md)
- [0167. 两数之和 II - 输入有序数组](https://github.com/itcharge/AlgoNote/blob/main/docs/solutions/0100-0199/two-sum-ii-input-array-is-sorted.md)
- [0704. 二分查找](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/binary-search.md)
- [0374. 猜数字大小](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/guess-number-higher-or-lower.md)
- [0035. 搜索插入位置](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/search-insert-position.md)
- [0167. 两数之和 II - 输入有序数组](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/two-sum-ii-input-array-is-sorted.md)

- [二分查找题目列表](https://github.com/ITCharge/AlgoNote/tree/main/docs/00_preface/00_06_categories_list.md#%E4%BA%8C%E5%88%86%E6%9F%A5%E6%89%BE%E9%A2%98%E7%9B%AE)
8 changes: 4 additions & 4 deletions docs/01_array/01_14_array_binary_search_02.md
Original file line number Diff line number Diff line change
Expand Up @@ -258,10 +258,10 @@ class Solution:

## 练习题目

- [0278. 第一个错误的版本](https://github.com/itcharge/AlgoNote/blob/main/docs/solutions/0200-0299/first-bad-version.md)
- [0069. x 的平方根](https://github.com/itcharge/AlgoNote/blob/main/docs/solutions/0001-0099/sqrtx.md)
- [1011. 在 D 天内送达包裹的能力](https://github.com/itcharge/AlgoNote/blob/main/docs/solutions/1000-1099/capacity-to-ship-packages-within-d-days.md)
- [0033. 搜索旋转排序数组](https://github.com/itcharge/AlgoNote/blob/main/docs/solutions/0001-0099/search-in-rotated-sorted-array.md)
- [0278. 第一个错误的版本](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/first-bad-version.md)
- [0069. x 的平方根](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/sqrtx.md)
- [1011. 在 D 天内送达包裹的能力](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1000-1099/capacity-to-ship-packages-within-d-days.md)
- [0033. 搜索旋转排序数组](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/search-in-rotated-sorted-array.md)
- [0153. 寻找旋转排序数组中的最小值](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/find-minimum-in-rotated-sorted-array.md)

- [二分查找题目列表](https://github.com/ITCharge/AlgoNote/tree/main/docs/00_preface/00_06_categories_list.md#%E4%BA%8C%E5%88%86%E6%9F%A5%E6%89%BE%E9%A2%98%E7%9B%AE)
Expand Down
4 changes: 2 additions & 2 deletions docs/01_array/01_15_array_two_pointers.md
Original file line number Diff line number Diff line change
Expand Up @@ -498,8 +498,8 @@ class Solution:
- [0344. 反转字符串](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/reverse-string.md)
- [0345. 反转字符串中的元音字母](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/reverse-vowels-of-a-string.md)
- [0015. 三数之和](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/3sum.md)
- [0027. 移除元素](https://github.com/itcharge/AlgoNote/blob/main/docs/solutions/0001-0099/remove-element.md)
- [0080. 删除有序数组中的重复项 II](https://github.com/itcharge/AlgoNote/blob/main/docs/solutions/0001-0099/remove-duplicates-from-sorted-array-ii.md)
- [0027. 移除元素](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/remove-element.md)
- [0080. 删除有序数组中的重复项 II](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/remove-duplicates-from-sorted-array-ii.md)
- [0925. 长按键入](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/long-pressed-name.md)

- [双指针题目列表](https://github.com/ITCharge/AlgoNote/tree/main/docs/00_preface/00_06_categories_list.md#%E5%8F%8C%E6%8C%87%E9%92%88%E9%A2%98%E7%9B%AE)
Expand Down
2 changes: 1 addition & 1 deletion docs/08_dynamic_programming/08_10_interval_dp.md
Original file line number Diff line number Diff line change
Expand Up @@ -388,4 +388,4 @@ class Solution:
- [1547. 切棍子的最小成本](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1500-1599/minimum-cost-to-cut-a-stick.md)
- [0664. 奇怪的打印机](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/strange-printer.md)

- [区间 DP 题目列表](https://github.com/itcharge/AlgoNote/blob/main/docs/00_preface/00_06_categories_list.md#%E5%8C%BA%E9%97%B4-dp-%E9%A2%98%E7%9B%AE)
- [区间 DP 题目列表](https://github.com/ITCharge/AlgoNote/tree/main/docs/00_preface/00_06_categories_list.md#%E5%8C%BA%E9%97%B4-dp-%E9%A2%98%E7%9B%AE)
4 changes: 2 additions & 2 deletions docs/08_dynamic_programming/08_15_probability_dp.md
Original file line number Diff line number Diff line change
Expand Up @@ -64,8 +64,8 @@

## 练习题目

- [0688. 骑士在棋盘上的概率](https://github.com/itcharge/AlgoNote/blob/main/docs/solutions/0600-0699/knight-probability-in-chessboard.md)
- [1227. 飞机座位分配概率](https://github.com/itcharge/AlgoNote/blob/main/docs/solutions/1200-1299/airplane-seat-assignment-probability.md)
- [0688. 骑士在棋盘上的概率](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0600-0699/knight-probability-in-chessboard.md)
- [1227. 飞机座位分配概率](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1200-1299/airplane-seat-assignment-probability.md)

- [概率 DP 题目列表](https://github.com/ITCharge/AlgoNote/tree/main/docs/00_preface/00_06_categories_list.md#%E6%A6%82%E7%8E%87-dp-%E9%A2%98%E7%9B%AE)

Expand Down