forked from itcharge/AlgoNote
-
Notifications
You must be signed in to change notification settings - Fork 0
[pull] main from itcharge:main #48
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
11 commits
Select commit
Hold shift + click to select a range
a94b3e4
Update 01.Priority-Queue.md
itcharge b17ab95
Update 01.Binary-Search-Tree.md
itcharge b27760f
更新题解列表
itcharge 2b26181
更新题解列表
itcharge f903a19
Update Course-Git-03.md
itcharge 45621eb
Create Course-Git-06.md
itcharge cc1ee21
Create Course-Git-07.md
itcharge cc9c134
Update Course-Git-06.md
itcharge 0f9d1f4
Update Course-Git-07.md
itcharge f132cb0
Update Course-Git-06.md
itcharge 213a58e
Update Course-Git-07.md
itcharge 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
103 changes: 103 additions & 0 deletions
Assets/Course/Course-Git-06.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 |
---|---|---|
@@ -0,0 +1,103 @@ | ||
# Leetcode 刷题课程第六期 | ||
|
||
## 课程信息 | ||
|
||
- 学习周期:16 天,每天平均花费时间 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:第 001 ~ 012 题(第 01 ~ 04 天) | ||
|
||
- 第 01 天课程题目: | ||
- [0054. 螺旋矩阵](https://leetcode.cn/problems/spiral-matrix/) | ||
- [0048. 旋转图像](https://leetcode.cn/problems/rotate-image/) | ||
- [0215. 数组中的第K个最大元素](https://leetcode.cn/problems/kth-largest-element-in-an-array/) | ||
- 第 02 天课程题目: | ||
- [0912. 排序数组](https://leetcode.cn/problems/sort-an-array/) | ||
- [0088. 合并两个有序数组](https://leetcode.cn/problems/merge-sorted-array/) | ||
- [0169. 多数元素](https://leetcode.cn/problems/majority-element/) | ||
- 第 03 天课程题目: | ||
- [0136. 只出现一次的数字](https://leetcode.cn/problems/single-number/) | ||
- [0056. 合并区间](https://leetcode.cn/problems/merge-intervals/) | ||
- [0179. 最大数](https://leetcode.cn/problems/largest-number/) | ||
- 第 04 天课程题目: | ||
- [0704. 二分查找](https://leetcode.cn/problems/binary-search/) | ||
- [0034. 在排序数组中查找元素的第一个和最后一个位置](https://leetcode.cn/problems/find-first-and-last-position-of-element-in-sorted-array/) | ||
- [0153. 寻找旋转排序数组中的最小值](https://leetcode.cn/problems/find-minimum-in-rotated-sorted-array/) | ||
|
||
### Task 02: 第 013 ~ 025 题( 第 05 ~ 08 天) | ||
|
||
- 第 05 天课程题目: | ||
- [0033. 搜索旋转排序数组](https://leetcode.cn/problems/search-in-rotated-sorted-array/) | ||
- [0162. 寻找峰值](https://leetcode.cn/problems/find-peak-element/) | ||
- [0004. 寻找两个正序数组的中位数](https://leetcode.cn/problems/median-of-two-sorted-arrays/) | ||
- 第 06 天课程题目: | ||
- [0240. 搜索二维矩阵 II](https://leetcode.cn/problems/search-a-2d-matrix-ii/) | ||
- [0069. x 的平方根](https://leetcode.cn/problems/sqrtx/) | ||
- [0283. 移动零](https://leetcode.cn/problems/move-zeroes/) | ||
- 第 07 天课程题目: | ||
- [0415. 字符串相加](https://leetcode.cn/problems/add-strings/) | ||
- [0239. 滑动窗口最大值](https://leetcode.cn/problems/sliding-window-maximum/) | ||
- [0003. 无重复字符的最长子串](https://leetcode.cn/problems/longest-substring-without-repeating-characters/) | ||
- 第 08 天课程题目: | ||
- [0076. 最小覆盖子串](https://leetcode.cn/problems/minimum-window-substring/) | ||
- [0718. 最长重复子数组](https://leetcode.cn/problems/maximum-length-of-repeated-subarray/) | ||
- [0083. 删除排序链表中的重复元素](https://leetcode.cn/problems/remove-duplicates-from-sorted-list/) | ||
- [0082. 删除排序链表中的重复元素 II](https://leetcode.cn/problems/remove-duplicates-from-sorted-list-ii/) | ||
|
||
### Task 03 第 026 ~ 037 题(第 09 ~ 12 天) | ||
|
||
- 第 09 天课程题目: | ||
- [0206. 反转链表](https://leetcode.cn/problems/reverse-linked-list/) | ||
- [0092. 反转链表 II](https://leetcode.cn/problems/reverse-linked-list-ii/) | ||
- [0025. K 个一组翻转链表](https://leetcode.cn/problems/reverse-nodes-in-k-group/) | ||
- 第 10 天课程题目: | ||
- [0234. 回文链表](https://leetcode.cn/problems/palindrome-linked-list/) | ||
- [0021. 合并两个有序链表](https://leetcode.cn/problems/merge-two-sorted-lists/) | ||
- [0148. 排序链表](https://leetcode.cn/problems/sort-list/) | ||
- 第 11 天课程题目: | ||
- [0023. 合并K个升序链表](https://leetcode.cn/problems/merge-k-sorted-lists/) | ||
- [0141. 环形链表](https://leetcode.cn/problems/linked-list-cycle/) | ||
- [0142. 环形链表 II](https://leetcode.cn/problems/linked-list-cycle-ii/) | ||
- 第 12 天课程题目: | ||
- [0160. 相交链表](https://leetcode.cn/problems/intersection-of-two-linked-lists/) | ||
- [0019. 删除链表的倒数第 N 个结点](https://leetcode.cn/problems/remove-nth-node-from-end-of-list/) | ||
- [0143. 重排链表](https://leetcode.cn/problems/reorder-list/) | ||
|
||
### Task 04:第 038 ~ 050 题(第 13 ~ 16 天) | ||
|
||
- 第 13 天课程题目: | ||
- [0002. 两数相加](https://leetcode.cn/problems/add-two-numbers/) | ||
- [0155. 最小栈](https://leetcode.cn/problems/min-stack/) | ||
- [0020. 有效的括号](https://leetcode.cn/problems/valid-parentheses/) | ||
- 第 14 天课程题目: | ||
- [0227. 基本计算器 II](https://leetcode.cn/problems/basic-calculator-ii/) | ||
- [0232. 用栈实现队列](https://leetcode.cn/problems/implement-queue-using-stacks/) | ||
- [0394. 字符串解码](https://leetcode.cn/problems/decode-string/) | ||
- 第 15 天课程题目: | ||
- [0032. 最长有效括号](https://leetcode.cn/problems/longest-valid-parentheses/) | ||
- [0042. 接雨水](https://leetcode.cn/problems/trapping-rain-water/) | ||
- [0225. 用队列实现栈](https://leetcode.cn/problems/implement-stack-using-queues/) | ||
- 第 16 天课程题目: | ||
- [0001. 两数之和](https://leetcode.cn/problems/two-sum/) | ||
- [0015. 三数之和](https://leetcode.cn/problems/3sum/) | ||
- [0041. 缺失的第一个正数](https://leetcode.cn/problems/first-missing-positive/) | ||
- [0128. 最长连续序列](https://leetcode.cn/problems/longest-consecutive-sequence/) | ||
- [更多面试题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/00.Introduction/07.Interview-200-List.md) | ||
|
||
### 附加题目 | ||
|
||
- [0146. LRU 缓存](https://leetcode.cn/problems/lru-cache/) | ||
- [0460. LFU 缓存](https://leetcode.cn/problems/lfu-cache/) | ||
- [0031. 下一个排列](https://leetcode.cn/problems/next-permutation/) |
103 changes: 103 additions & 0 deletions
Assets/Course/Course-Git-07.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 |
---|---|---|
@@ -0,0 +1,103 @@ | ||
# Leetcode 刷题课程第七期 | ||
|
||
## 课程信息 | ||
|
||
- 学习周期:16 天,每天平均花费时间 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:第 051 ~ 062 题(第 01 ~ 04 天) | ||
|
||
- 第 01 天课程题目: | ||
- [0003. 无重复字符的最长子串](https://leetcode.cn/problems/longest-substring-without-repeating-characters/) | ||
- [0005. 最长回文子串](https://leetcode.cn/problems/longest-palindromic-substring/) | ||
- [0008. 字符串转换整数 (atoi)](https://leetcode.cn/problems/string-to-integer-atoi/) | ||
- 第 02 天课程题目: | ||
- [0151. 反转字符串中的单词](https://leetcode.cn/problems/reverse-words-in-a-string/) | ||
- [0043. 字符串相乘](https://leetcode.cn/problems/multiply-strings/) | ||
- [0014. 最长公共前缀](https://leetcode.cn/problems/longest-common-prefix/) | ||
- 第 03 天课程题目: | ||
- [0144. 二叉树的前序遍历](https://leetcode.cn/problems/binary-tree-preorder-traversal/) | ||
- [0094. 二叉树的中序遍历](https://leetcode.cn/problems/binary-tree-inorder-traversal/) | ||
- [0102. 二叉树的层序遍历](https://leetcode.cn/problems/binary-tree-level-order-traversal/) | ||
- 第 04 天课程题目: | ||
- [0103. 二叉树的锯齿形层序遍历](https://leetcode.cn/problems/binary-tree-zigzag-level-order-traversal/) | ||
- [0236. 二叉树的最近公共祖先](https://leetcode.cn/problems/lowest-common-ancestor-of-a-binary-tree/) | ||
- [0104. 二叉树的最大深度](https://leetcode.cn/problems/maximum-depth-of-binary-tree/) | ||
|
||
### Task 02: 第 063 ~ 074 题( 第 05 ~ 08 天) | ||
|
||
- 第 05 天课程题目: | ||
- [0112. 路径总和](https://leetcode.cn/problems/path-sum/) | ||
- [0113. 路径总和 II](https://leetcode.cn/problems/path-sum-ii/) | ||
- [0101. 对称二叉树](https://leetcode.cn/problems/symmetric-tree/) | ||
- 第 06 天课程题目: | ||
- [0124. 二叉树中的最大路径和](https://leetcode.cn/problems/binary-tree-maximum-path-sum/) | ||
- [0199. 二叉树的右视图](https://leetcode.cn/problems/binary-tree-right-side-view/) | ||
- [0226. 翻转二叉树](https://leetcode.cn/problems/invert-binary-tree/) | ||
- 第 07 天课程题目: | ||
- [0105. 从前序与中序遍历序列构造二叉树](https://leetcode.cn/problems/construct-binary-tree-from-preorder-and-inorder-traversal/) | ||
- [0098. 验证二叉搜索树](https://leetcode.cn/problems/validate-binary-search-tree/) | ||
- [0110. 平衡二叉树](https://leetcode.cn/problems/balanced-binary-tree/) | ||
- 第 08 天课程题目: | ||
- [0200. 岛屿数量](https://leetcode.cn/problems/number-of-islands/) | ||
- [0695. 岛屿的最大面积](https://leetcode.cn/problems/max-area-of-island/) | ||
- [0129. 求根节点到叶节点数字之和](https://leetcode.cn/problems/sum-root-to-leaf-numbers/) | ||
|
||
### Task 03 第 075 ~ 087(第 09 ~ 12 天) | ||
|
||
- 第 09 天课程题目: | ||
- [0199. 二叉树的右视图](https://leetcode.cn/problems/binary-tree-right-side-view/) | ||
- [0543. 二叉树的直径](https://leetcode.cn/problems/diameter-of-binary-tree/) | ||
- [0662. 二叉树最大宽度](https://leetcode.cn/problems/maximum-width-of-binary-tree/) | ||
- 第 10 天课程题目: | ||
- [0322. 零钱兑换](https://leetcode.cn/problems/coin-change/) | ||
- [0078. 子集](https://leetcode.cn/problems/subsets/) | ||
- [0221. 最大正方形](https://leetcode.cn/problems/maximal-square/) | ||
- 第 11 天课程题目: | ||
- [0024. 两两交换链表中的节点](https://leetcode.cn/problems/swap-nodes-in-pairs/) | ||
- [0070. 爬楼梯](https://leetcode.cn/problems/climbing-stairs/) | ||
- [0053. 最大子数组和](https://leetcode.cn/problems/maximum-subarray/) | ||
- 第 12 天课程题目: | ||
- [0046. 全排列](https://leetcode.cn/problems/permutations/) | ||
- [0022. 括号生成](https://leetcode.cn/problems/generate-parentheses/) | ||
- [0039. 组合总和](https://leetcode.cn/problems/combination-sum/) | ||
- [0093. 复原 IP 地址](https://leetcode.cn/problems/restore-ip-addresses/) | ||
|
||
### Task 04:第 088 ~ 100 题(第 13 ~ 16 天) | ||
|
||
- 第 13 天课程题目: | ||
- [0121. 买卖股票的最佳时机](https://leetcode.cn/problems/best-time-to-buy-and-sell-stock/) | ||
- [0122. 买卖股票的最佳时机 II](https://leetcode.cn/problems/best-time-to-buy-and-sell-stock-ii/) | ||
- [0300. 最长递增子序列](https://leetcode.cn/problems/longest-increasing-subsequence/) | ||
- 第 14 天课程题目: | ||
- [1143. 最长公共子序列](https://leetcode.cn/problems/longest-common-subsequence/) | ||
- [0064. 最小路径和](https://leetcode.cn/problems/minimum-path-sum/) | ||
- [0072. 编辑距离](https://leetcode.cn/problems/edit-distance/) | ||
- 第 15 天课程题目: | ||
- [0062. 不同路径](https://leetcode.cn/problems/unique-paths/) | ||
- [0152. 乘积最大子数组](https://leetcode.cn/problems/maximum-product-subarray/) | ||
- [0198. 打家劫舍](https://leetcode.cn/problems/house-robber/) | ||
- 第 16 天课程题目: | ||
- [0138. 复制带随机指针的链表](https://leetcode.cn/problems/copy-list-with-random-pointer/) | ||
- [0297. 二叉树的序列化与反序列化](https://leetcode.cn/problems/serialize-and-deserialize-binary-tree/) | ||
- [0209. 长度最小的子数组](https://leetcode.cn/problems/minimum-size-subarray-sum/) | ||
- [0139. 单词拆分](https://leetcode.cn/problems/word-break/) | ||
- [更多面试题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/00.Introduction/07.Interview-200-List.md) | ||
|
||
### 附加题目 | ||
|
||
- [0165. 比较版本号](https://leetcode.cn/problems/compare-version-numbers/) | ||
- [0468. 验证IP地址](https://leetcode.cn/problems/validate-ip-address/) | ||
- [0470. 用 Rand7() 实现 Rand10()](https://leetcode.cn/problems/implement-rand10-using-rand7/) |
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
Oops, something went wrong.
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.