|
| 1 | +# Leetcode 刷题课程第七期 |
| 2 | + |
| 3 | +## 课程信息 |
| 4 | + |
| 5 | +- 学习周期:16 天,每天平均花费时间 1 小时 ~ 3 小时不等,根据个人学习接受能力强弱有所浮动。 |
| 6 | +- 学习形式:理论学习 + 题目刷题 |
| 7 | +- 人群定位:有 Python 语言编程基础,想要学习算法、数据结构基础知识,想在 LeetCode 刷算法题的学员。 |
| 8 | +- 难度系数:⭐⭐ |
| 9 | + |
| 10 | +## 课程大纲 |
| 11 | + |
| 12 | +### Task 00:熟悉规则(1 天) |
| 13 | + |
| 14 | +- 组队、修改群昵称。 |
| 15 | +- 熟悉打卡规则。 |
| 16 | +- 之前从未在 LeetCode 上刷过题的同学建议阅读相关内容:[LeetCode 入门与攻略](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/00.Introduction/03.LeetCode-Guide.md)。 |
| 17 | + |
| 18 | +--- |
| 19 | + |
| 20 | +### Task 01:第 051 ~ 062 题(第 01 ~ 04 天) |
| 21 | + |
| 22 | +- 第 01 天课程题目: |
| 23 | + - [0003. 无重复字符的最长子串](https://leetcode.cn/problems/longest-substring-without-repeating-characters/) |
| 24 | + - [0005. 最长回文子串](https://leetcode.cn/problems/longest-palindromic-substring/) |
| 25 | + - [0008. 字符串转换整数 (atoi)](https://leetcode.cn/problems/string-to-integer-atoi/) |
| 26 | +- 第 02 天课程题目: |
| 27 | + - [0151. 反转字符串中的单词](https://leetcode.cn/problems/reverse-words-in-a-string/) |
| 28 | + - [0043. 字符串相乘](https://leetcode.cn/problems/multiply-strings/) |
| 29 | + - [0014. 最长公共前缀](https://leetcode.cn/problems/longest-common-prefix/) |
| 30 | +- 第 03 天课程题目: |
| 31 | + - [0144. 二叉树的前序遍历](https://leetcode.cn/problems/binary-tree-preorder-traversal/) |
| 32 | + - [0094. 二叉树的中序遍历](https://leetcode.cn/problems/binary-tree-inorder-traversal/) |
| 33 | + - [0102. 二叉树的层序遍历](https://leetcode.cn/problems/binary-tree-level-order-traversal/) |
| 34 | +- 第 04 天课程题目: |
| 35 | + - [0103. 二叉树的锯齿形层序遍历](https://leetcode.cn/problems/binary-tree-zigzag-level-order-traversal/) |
| 36 | + - [0236. 二叉树的最近公共祖先](https://leetcode.cn/problems/lowest-common-ancestor-of-a-binary-tree/) |
| 37 | + - [0104. 二叉树的最大深度](https://leetcode.cn/problems/maximum-depth-of-binary-tree/) |
| 38 | + |
| 39 | +### Task 02: 第 063 ~ 074 题( 第 05 ~ 08 天) |
| 40 | + |
| 41 | +- 第 05 天课程题目: |
| 42 | + - [0112. 路径总和](https://leetcode.cn/problems/path-sum/) |
| 43 | + - [0113. 路径总和 II](https://leetcode.cn/problems/path-sum-ii/) |
| 44 | + - [0101. 对称二叉树](https://leetcode.cn/problems/symmetric-tree/) |
| 45 | +- 第 06 天课程题目: |
| 46 | + - [0124. 二叉树中的最大路径和](https://leetcode.cn/problems/binary-tree-maximum-path-sum/) |
| 47 | + - [0199. 二叉树的右视图](https://leetcode.cn/problems/binary-tree-right-side-view/) |
| 48 | + - [0226. 翻转二叉树](https://leetcode.cn/problems/invert-binary-tree/) |
| 49 | +- 第 07 天课程题目: |
| 50 | + - [0105. 从前序与中序遍历序列构造二叉树](https://leetcode.cn/problems/construct-binary-tree-from-preorder-and-inorder-traversal/) |
| 51 | + - [0098. 验证二叉搜索树](https://leetcode.cn/problems/validate-binary-search-tree/) |
| 52 | + - [0110. 平衡二叉树](https://leetcode.cn/problems/balanced-binary-tree/) |
| 53 | +- 第 08 天课程题目: |
| 54 | + - [0200. 岛屿数量](https://leetcode.cn/problems/number-of-islands/) |
| 55 | + - [0695. 岛屿的最大面积](https://leetcode.cn/problems/max-area-of-island/) |
| 56 | + - [0129. 求根节点到叶节点数字之和](https://leetcode.cn/problems/sum-root-to-leaf-numbers/) |
| 57 | + |
| 58 | +### Task 03 第 075 ~ 087(第 09 ~ 12 天) |
| 59 | + |
| 60 | +- 第 09 天课程题目: |
| 61 | + - [0199. 二叉树的右视图](https://leetcode.cn/problems/binary-tree-right-side-view/) |
| 62 | + - [0543. 二叉树的直径](https://leetcode.cn/problems/diameter-of-binary-tree/) |
| 63 | + - [0662. 二叉树最大宽度](https://leetcode.cn/problems/maximum-width-of-binary-tree/) |
| 64 | +- 第 10 天课程题目: |
| 65 | + - [0322. 零钱兑换](https://leetcode.cn/problems/coin-change/) |
| 66 | + - [0078. 子集](https://leetcode.cn/problems/subsets/) |
| 67 | + - [0221. 最大正方形](https://leetcode.cn/problems/maximal-square/) |
| 68 | +- 第 11 天课程题目: |
| 69 | + - [0024. 两两交换链表中的节点](https://leetcode.cn/problems/swap-nodes-in-pairs/) |
| 70 | + - [0070. 爬楼梯](https://leetcode.cn/problems/climbing-stairs/) |
| 71 | + - [0053. 最大子数组和](https://leetcode.cn/problems/maximum-subarray/) |
| 72 | +- 第 12 天课程题目: |
| 73 | + - [0046. 全排列](https://leetcode.cn/problems/permutations/) |
| 74 | + - [0022. 括号生成](https://leetcode.cn/problems/generate-parentheses/) |
| 75 | + - [0039. 组合总和](https://leetcode.cn/problems/combination-sum/) |
| 76 | + - [0093. 复原 IP 地址](https://leetcode.cn/problems/restore-ip-addresses/) |
| 77 | + |
| 78 | +### Task 04:第 088 ~ 100 题(第 13 ~ 16 天) |
| 79 | + |
| 80 | +- 第 13 天课程题目: |
| 81 | + - [0121. 买卖股票的最佳时机](https://leetcode.cn/problems/best-time-to-buy-and-sell-stock/) |
| 82 | + - [0122. 买卖股票的最佳时机 II](https://leetcode.cn/problems/best-time-to-buy-and-sell-stock-ii/) |
| 83 | + - [0300. 最长递增子序列](https://leetcode.cn/problems/longest-increasing-subsequence/) |
| 84 | +- 第 14 天课程题目: |
| 85 | + - [1143. 最长公共子序列](https://leetcode.cn/problems/longest-common-subsequence/) |
| 86 | + - [0064. 最小路径和](https://leetcode.cn/problems/minimum-path-sum/) |
| 87 | + - [0072. 编辑距离](https://leetcode.cn/problems/edit-distance/) |
| 88 | +- 第 15 天课程题目: |
| 89 | + - [0062. 不同路径](https://leetcode.cn/problems/unique-paths/) |
| 90 | + - [0152. 乘积最大子数组](https://leetcode.cn/problems/maximum-product-subarray/) |
| 91 | + - [0198. 打家劫舍](https://leetcode.cn/problems/house-robber/) |
| 92 | +- 第 16 天课程题目: |
| 93 | + - [0165. 比较版本号](https://leetcode.cn/problems/compare-version-numbers/) |
| 94 | + - [0468. 验证IP地址](https://leetcode.cn/problems/validate-ip-address/) |
| 95 | + - [0031. 下一个排列](https://leetcode.cn/problems/next-permutation/) |
| 96 | + - [0470. 用 Rand7() 实现 Rand10()](https://leetcode.cn/problems/implement-rand10-using-rand7/) |
| 97 | +- [更多面试题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/00.Introduction/07.Interview-200-List.md) |
0 commit comments