forked from itcharge/AlgoNote
-
Notifications
You must be signed in to change notification settings - Fork 0
[pull] main from itcharge:main #45
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
Changes from all commits
Commits
Show all changes
5 commits
Select commit
Hold shift + click to select a range
File filter
Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
There are no files selected for viewing
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
106 changes: 106 additions & 0 deletions
Assets/Course/Course-Git-04.md
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1 +1,107 @@ | ||
# Leetcode 刷题课程第四期 | ||
|
||
## 课程信息 | ||
|
||
- 学习周期:14 天,每天平均花费时间 1 小时 ~ 3 小时不等,根据个人学习接受能力强弱有所浮动。 | ||
- 学习形式:理论学习 + 题目刷题 | ||
- 人群定位:有 Python 语言编程基础,想要学习算法、数据结构基础知识,想在 LeetCode 刷算法题的学员。 | ||
- 难度系数:⭐⭐ | ||
|
||
## 课程大纲 | ||
|
||
### Task 00:熟悉规则(1 天) | ||
|
||
- 组队、修改群昵称。 | ||
- 熟悉打卡规则。 | ||
- 之前从未在 LeetCode 上刷过题的同学建议阅读相关内容:[LeetCode 入门与攻略](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/00.Introduction/03.LeetCode-Guide.md)。 | ||
|
||
--- | ||
|
||
### Task 01:枚举算法(第 01 ~ 02 天) | ||
|
||
- 第 01 ~ 02 天学习内容: | ||
- [枚举算法知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/09.Algorithm-Base/01.Enumeration-Algorithm/01.Enumeration-Algorithm.md) | ||
- 第 01 天课程题目: | ||
- [0001. 两数之和](https://leetcode.cn/problems/two-sum/) | ||
- [0204. 计数质数](https://leetcode.cn/problems/count-primes/) | ||
- [1925. 统计平方和三元组的数目](https://leetcode.cn/problems/count-square-sum-triples/) | ||
- 第 02 天课程题目: | ||
- [1620. 网络信号最好的坐标](https://leetcode.cn/problems/coordinate-with-maximum-network-quality/) | ||
- [0078. 子集](https://leetcode.cn/problems/subsets/) | ||
- [0090. 子集 II](https://leetcode.cn/problems/subsets-ii/) | ||
- [更多枚举算法相关题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/09.Algorithm-Base/01.Enumeration-Algorithm/02.Enumeration-Algorithm-List.md) | ||
|
||
### Task 02:递归算法(第 03 ~ 04 天) | ||
|
||
- 第 03 ~ 04 天学习内容: | ||
- [递归算法知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/09.Algorithm-Base/02.Recursive-Algorithm/01.Recursive-Algorithm.md) | ||
- 第 03 天课程题目: | ||
- [0509. 斐波那契数](https://leetcode.cn/problems/fibonacci-number/) | ||
- [0070. 爬楼梯](https://leetcode.cn/problems/climbing-stairs/) | ||
- [0226. 翻转二叉树](https://leetcode.cn/problems/invert-binary-tree/) | ||
- 第 04 天课程题目: | ||
- [0206. 反转链表](https://leetcode.cn/problems/reverse-linked-list/) | ||
- [0092. 反转链表 II](https://leetcode.cn/problems/reverse-linked-list-ii/) | ||
- [0779. 第K个语法符号](https://leetcode.cn/problems/k-th-symbol-in-grammar/) | ||
- [更多递归算法相关题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/09.Algorithm-Base/02.Recursive-Algorithm/02.Recursive-Algorithm-List.md) | ||
|
||
### Task 03 分治算法与回溯算法(第 05 ~ 09 天) | ||
|
||
- 第 05 ~ 06 天学习内容: | ||
- [分治算法知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/09.Algorithm-Base/03.Divide-And-Conquer-Algorithm/01.Divide-And-Conquer-Algorithm.md) | ||
- 第 05 天课程题目: | ||
- [0050. Pow(x, n)](https://leetcode.cn/problems/powx-n/) | ||
- [0169. 多数元素](https://leetcode.cn/problems/majority-element/) | ||
- [0053. 最大子数组和](https://leetcode.cn/problems/maximum-subarray/) | ||
- 第 06 天课程题目: | ||
- [0932. 漂亮数组](https://leetcode.cn/problems/beautiful-array/) | ||
- [0241. 为运算表达式设计优先级](https://leetcode.cn/problems/different-ways-to-add-parentheses/) | ||
- [0023. 合并K个升序链表](https://leetcode.cn/problems/merge-k-sorted-lists/) | ||
- [更多分治算法题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/09.Algorithm-Base/03.Divide-And-Conquer-Algorithm/02.Divide-And-Conquer-Algorithm-List.md) | ||
- 第 07 ~ 09 天学习内容: | ||
- [回溯算法知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/09.Algorithm-Base/04.Backtracking-Algorithm/01.Backtracking-Algorithm.md) | ||
- 第 07 天课程题目: | ||
- [0046. 全排列](https://leetcode.cn/problems/permutations/) | ||
- [0047. 全排列 II](https://leetcode.cn/problems/permutations-ii/) | ||
- [0022. 括号生成](https://leetcode.cn/problems/generate-parentheses/) | ||
- 第 08 天课程题目: | ||
- [0017. 电话号码的字母组合](https://leetcode.cn/problems/letter-combinations-of-a-phone-number/) | ||
- [0039. 组合总和](https://leetcode.cn/problems/combination-sum/) | ||
- [0040. 组合总和 II](https://leetcode.cn/problems/combination-sum-ii/) | ||
- 第 09 天课程题目: | ||
- [0078. 子集](https://leetcode.cn/problems/subsets/) | ||
- [0090. 子集 II](https://leetcode.cn/problems/subsets-ii/) | ||
- [0079. 单词搜索](https://leetcode.cn/problems/word-search/) | ||
- [更多回溯算法题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/09.Algorithm-Base/04.Backtracking-Algorithm/02.Backtracking-Algorithm-List.md) | ||
|
||
### Task 04:贪心算法(第 10 ~ 12 天) | ||
|
||
- 第 10 ~ 12 天学习内容: | ||
- [贪心算法知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/09.Algorithm-Base/05.Greedy-Algorithm/01.Greedy-Algorithm.md) | ||
- 第 10 天课程题目: | ||
- [0455. 分发饼干](https://leetcode.cn/problems/assign-cookies/) | ||
- [0860. 柠檬水找零](https://leetcode.cn/problems/lemonade-change/) | ||
- [0135. 分发糖果](https://leetcode.cn/problems/candy/) | ||
- 第 11 天课程题目: | ||
- [0055. 跳跃游戏](https://leetcode.cn/problems/jump-game/) | ||
- [0045. 跳跃游戏 II](https://leetcode.cn/problems/jump-game-ii/) | ||
- [0881. 救生艇](https://leetcode.cn/problems/boats-to-save-people/) | ||
- 第 12 天课程题目: | ||
- [0435. 无重叠区间](https://leetcode.cn/problems/non-overlapping-intervals/) | ||
- [0452. 用最少数量的箭引爆气球](https://leetcode.cn/problems/minimum-number-of-arrows-to-burst-balloons/) | ||
- [1710. 卡车上的最大单元数](https://leetcode.cn/problems/maximum-units-on-a-truck/) | ||
- [更多贪心算法题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/09.Algorithm-Base/05.Greedy-Algorithm/02.Greedy-Algorithm-List.md) | ||
|
||
### Task 05. 位运算(第 13 ~ 14 天) | ||
|
||
- 第 13 ~ 14 天学习内容: | ||
- [位运算知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/09.Algorithm-Base/06.Bit-Operation/01.Bit-Operation.md) | ||
- 第 13 天课程题目: | ||
- [0190. 颠倒二进制位](https://leetcode.cn/problems/reverse-bits/) | ||
- [0191. 位1的个数](https://leetcode.cn/problems/number-of-1-bits/) | ||
- [0201. 数字范围按位与](https://leetcode.cn/problems/bitwise-and-of-numbers-range/) | ||
- 第 14 天课程题目: | ||
- [0136. 只出现一次的数字](https://leetcode.cn/problems/single-number/) | ||
- [0137. 只出现一次的数字 II](https://leetcode.cn/problems/single-number-ii/) | ||
- [0260. 只出现一次的数字 III](https://leetcode.cn/problems/single-number-iii/) | ||
- [更多位运算题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/09.Algorithm-Base/06.Bit-Operation/02.Bit-Operation-List.md) |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
2 changes: 1 addition & 1 deletion
Solutions/0028. 实现 strStr().md → Solutions/0028. 找出字符串中第一个匹配项的下标.md
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.