Update readme.md
This commit is contained in:
MYP
parent
ad4e867350
commit
617d889fd7
|
|
@ -1,4 +1,144 @@
|
|||
## 简介
|
||||
|
||||
# 编程实践（LeetCode 腾讯精选练习50）
|
||||
|
||||
|
||||
开源内容：https://github.com/datawhalechina/team-learning-program/tree/master/LeetCodeTencent
|
||||
|
||||
## 基本信息
|
||||
|
||||
- 学习周期：17天，每天平均花费时间2小时-5小时不等，根据个人学习接受能力强弱有所浮动。
|
||||
- 学习形式：练习
|
||||
- 人群定位：有一定编程基础，对学习算法有需求的学员。
|
||||
- 先修内容：[Python编程语言](https://github.com/datawhalechina/team-learning-program/tree/master/PythonLanguage)、[数据结构与算法](https://github.com/datawhalechina/team-learning-program/tree/master/DataStructureAndAlgorithm)、[编程实践（LeetCode 分类练习）](https://github.com/datawhalechina/team-learning-program/tree/master/LeetCodeClassification)
|
||||
- 难度系数：中
|
||||
|
||||
## 学习目标
|
||||
|
||||
每天刷三道题，利用17天完成Leetcode腾讯精选练习50题。
|
||||
|
||||
|
||||
|
||||
## 任务安排
|
||||
|
||||
|
||||
### Task00：熟悉规则（1天）
|
||||
|
||||
- 组队、修改群昵称
|
||||
- 熟悉打卡规则
|
||||
|
||||
### Task01：完成以下三个题目并打卡（1天）
|
||||
|
||||
- [002 两数相加](https://leetcode-cn.com/problems/add-two-numbers/)
|
||||
- [004 寻找两个正序数组的中位数](https://leetcode-cn.com/problems/median-of-two-sorted-arrays/)
|
||||
- [005 最长回文子串](https://leetcode-cn.com/problems/longest-palindromic-substring/)
|
||||
|
||||
### Task02: 完成以下三个题目并打卡（1天）
|
||||
|
||||
- [007 整数反转](https://leetcode-cn.com/problems/reverse-integer/)
|
||||
- [008 字符串转换整数 (atoi)](https://leetcode-cn.com/problems/string-to-integer-atoi/)
|
||||
- [009 回文数](https://leetcode-cn.com/problems/palindrome-number/)
|
||||
|
||||
### Task03: 完成以下三个题目并打卡（1天）
|
||||
|
||||
- [011 盛最多水的容器](https://leetcode-cn.com/problems/container-with-most-water/)
|
||||
- [014 最长公共前缀](https://leetcode-cn.com/problems/longest-common-prefix/)
|
||||
- [015 三数之和](https://leetcode-cn.com/problems/3sum/)
|
||||
|
||||
### Task04: 完成以下三个题目并打卡（1天）
|
||||
|
||||
- [016 最接近的三数之和](https://leetcode-cn.com/problems/3sum-closest/)
|
||||
- [020 有效的括号](https://leetcode-cn.com/problems/valid-parentheses/)
|
||||
- [021 合并两个有序链表](https://leetcode-cn.com/problems/merge-two-sorted-lists/)
|
||||
|
||||
### Task05: 完成以下三个题目并打卡（1天）
|
||||
|
||||
- [023 合并K个排序链表](https://leetcode-cn.com/problems/merge-k-sorted-lists/)
|
||||
- [026 删除排序数组中的重复项](https://leetcode-cn.com/problems/remove-duplicates-from-sorted-array/)
|
||||
- [033 搜索旋转排序数组](https://leetcode-cn.com/problems/search-in-rotated-sorted-array/)
|
||||
|
||||
### Task06：完成以下三个题目并打卡（1天）
|
||||
|
||||
- [043 字符串相乘](https://leetcode-cn.com/problems/multiply-strings/)
|
||||
- [046 全排列](https://leetcode-cn.com/problems/permutations/)
|
||||
- [053 最大子序和](https://leetcode-cn.com/problems/maximum-subarray/)
|
||||
|
||||
### Task07: 完成以下三个题目并打卡（1天）
|
||||
|
||||
- [054 螺旋矩阵](https://leetcode-cn.com/problems/spiral-matrix/)
|
||||
- [059 螺旋矩阵 II](https://leetcode-cn.com/problems/spiral-matrix-ii/)
|
||||
- [061 旋转链表](https://leetcode-cn.com/problems/rotate-list/)
|
||||
|
||||
### Task 08: 完成以下三个题目并打卡（1天）
|
||||
|
||||
- [062 不同路径](https://leetcode-cn.com/problems/unique-paths/)
|
||||
- [070 爬楼梯](https://leetcode-cn.com/problems/climbing-stairs/)
|
||||
- [078 子集](https://leetcode-cn.com/problems/subsets/)
|
||||
|
||||
### Task09: 完成以下三个题目并打卡（1天）
|
||||
|
||||
- [088 合并两个有序数组](https://leetcode-cn.com/problems/merge-sorted-array/)
|
||||
- [089 格雷编码](https://leetcode-cn.com/problems/gray-code/)
|
||||
- [104 二叉树的最大深度](https://leetcode-cn.com/problems/maximum-depth-of-binary-tree/)
|
||||
|
||||
### Task10: 完成以下三个题目并打卡（1天）
|
||||
|
||||
- [121 买卖股票的最佳时机](https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock/)
|
||||
- [122 买卖股票的最佳时机 II](https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-ii/)
|
||||
- [124 二叉树中的最大路径和](https://leetcode-cn.com/problems/binary-tree-maximum-path-sum/)
|
||||
|
||||
### Task11: 完成以下三个题目并打卡（1天）
|
||||
|
||||
- [136 只出现一次的数字](https://leetcode-cn.com/problems/single-number/)
|
||||
- [141 环形链表](https://leetcode-cn.com/problems/linked-list-cycle/)
|
||||
- [142 环形链表 II](https://leetcode-cn.com/problems/linked-list-cycle-ii/)
|
||||
|
||||
### Task12: 完成以下三个题目并打卡（1天）
|
||||
|
||||
- [146 LRU缓存机制](https://leetcode-cn.com/problems/lru-cache/)
|
||||
- [148 排序链表](https://leetcode-cn.com/problems/sort-list/)
|
||||
- [155 最小栈](https://leetcode-cn.com/problems/min-stack/)
|
||||
|
||||
### Task13: 完成以下三个题目并打卡（1天）
|
||||
|
||||
- [160 相交链表](https://leetcode-cn.com/problems/intersection-of-two-linked-lists/)
|
||||
- [169 多数元素](https://leetcode-cn.com/problems/majority-element/)
|
||||
- [206 反转链表](https://leetcode-cn.com/problems/reverse-linked-list/)
|
||||
|
||||
|
||||
### Task14：完成以下三个题目并打卡（1天）
|
||||
|
||||
- [215 数组中的第K个最大元素](https://leetcode-cn.com/problems/kth-largest-element-in-an-array/)
|
||||
- [217 存在重复元素](https://leetcode-cn.com/problems/contains-duplicate/)
|
||||
- [230 二叉搜索树中第K小的元素](https://leetcode-cn.com/problems/kth-smallest-element-in-a-bst/)
|
||||
|
||||
### Task15：完成以下三个题目并打卡（1天）
|
||||
|
||||
- [231 2的幂](https://leetcode-cn.com/problems/power-of-two/)
|
||||
- [235 二叉搜索树的最近公共祖先](https://leetcode-cn.com/problems/lowest-common-ancestor-of-a-binary-search-tree/)
|
||||
- [236 二叉树的最近公共祖先](https://leetcode-cn.com/problems/lowest-common-ancestor-of-a-binary-tree/)
|
||||
|
||||
### Task16：完成以下三个题目并打卡（1天）
|
||||
|
||||
- [237 删除链表中的节点](https://leetcode-cn.com/problems/delete-node-in-a-linked-list/)
|
||||
- [238 除自身以外数组的乘积](https://leetcode-cn.com/problems/product-of-array-except-self/)
|
||||
- [292 Nim 游戏](https://leetcode-cn.com/problems/nim-game/)
|
||||
|
||||
### Task17：完成以下三个题目并打卡（1天）
|
||||
|
||||
- [344 反转字符串](https://leetcode-cn.com/problems/reverse-string/)
|
||||
- [557 反转字符串中的单词 III](https://leetcode-cn.com/problems/reverse-words-in-a-string-iii/)
|
||||
|
||||
|
||||
# 贡献人员
|
||||
|
||||
姓名 | 博客|备注
|
||||
---|---|---
|
||||
马燕鹏|CSDN：https://lsgogroup.blog.csdn.net/<br>微信公众号：LSGO软件技术团队|华北电力大学
|
||||
韩绘锦|CSDN：https://blog.csdn.net/weixin_45569785|华北电力大学
|
||||
姚行志|CSDN：https://blog.csdn.net/soulmate______|华北电力大学
|
||||
徐韬||华北电力大学
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
|
|
|
|||
Loading…
Reference in New Issue