Description
要求
- 每周至少完成给定题目中的两道算法题
- 围绕每周重点学习的算法知识点,撰写一篇有观点和思考的技术文章(字数不限)
注意事项
- 下面列出的题目中,按照知识点进行了简单分类,但并不意味着使用相应的数据结构或算法一定是解决该题目的最优解,这样分类只是为了方便大家有针对性的练习;
- 有的题目可能需要结合多个算法或数据结构进行求解。
第一周题目
链表
简单:https://leetcode-cn.com/problems/remove-duplicates-from-sorted-list/
简单:https://leetcode-cn.com/problems/merge-two-sorted-lists
中等:https://leetcode-cn.com/problems/swap-nodes-in-pairs/
中等:https://leetcode-cn.com/problems/linked-list-cycle-ii
困难:https://leetcode-cn.com/problems/reverse-nodes-in-k-group/
数组
简单:https://leetcode-cn.com/problems/sort-array-by-parity/
简单:https://leetcode-cn.com/problems/sort-array-by-parity-ii/
中等:https://leetcode-cn.com/problems/search-in-rotated-sorted-array-ii/
中等:https://leetcode-cn.com/problems/find-minimum-in-rotated-sorted-array/
困难:https://leetcode-cn.com/problems/search-in-rotated-sorted-array
栈
简单:https://leetcode-cn.com/problems/valid-parentheses/
中等:https://leetcode-cn.com/problems/next-greater-element-ii/
困难:https://leetcode-cn.com/problems/maximum-frequency-stack/
递归
简单:https://leetcode-cn.com/problems/longest-univalue-path/
中等:https://leetcode-cn.com/problems/partition-to-k-equal-sum-subsets/
困难:https://leetcode-cn.com/problems/special-binary-string/
排序
简单:https://leetcode-cn.com/problems/valid-anagram/
中等:https://leetcode-cn.com/problems/wiggle-sort-ii/
困难:https://leetcode-cn.com/problems/maximum-gap/
二分查找
简单:https://leetcode-cn.com/problems/arranging-coins/
中等:https://leetcode-cn.com/problems/powx-n/
困难:https://leetcode-cn.com/problems/dungeon-game/
作业提交规则
- 在提交作业之前,请先阅读这里的 README 文档:https://github.com/algorithm001/algorithm/blob/master/README.md
- 然后在此 Issues 下按照如下格式回复(示例见一楼):
- 学号 + GitHub Username
- 作业代码的 GitHub 链接(填写自己仓库下对应的作业链接即可,同时记得给本仓库提交 pull request)
- 发表自己本周的学习感言 issues,并提交链接,issues 标题格式:“【学号后三位-week1】+文章标题”,格式参考:示例:【000-week1】关于二分查找的一些新的理解 #9