Skip to content

Latest commit

 

History

History
 
 

深度优先、广度优先实战题目

https://leetcode-cn.com/problems/binary-tree-level-order-traversal/#/description

https://leetcode-cn.com/problems/minimum-genetic-mutation/#/description

https://leetcode-cn.com/problems/generate-parentheses/#/description

https://leetcode-cn.com/problems/find-largest-value-in-each-tree-row/#/description

课后作业

https://leetcode-cn.com/problems/word-ladder/description/

https://leetcode-cn.com/problems/word-ladder-ii/description/

https://leetcode-cn.com/problems/number-of-islands/

https://leetcode-cn.com/problems/minesweeper/description/

贪心算法课后作业

https://leetcode-cn.com/problems/lemonade-change/description/

https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-ii/description/

https://leetcode-cn.com/problems/assign-cookies/description/

https://leetcode-cn.com/problems/walking-robot-simulation/description/

https://leetcode-cn.com/problems/jump-game/

https://leetcode-cn.com/problems/jump-game-ii/

二分查找实战题目

https://leetcode-cn.com/problems/sqrtx/

https://leetcode-cn.com/problems/valid-perfect-square/

课后作业

https://leetcode-cn.com/problems/search-in-rotated-sorted-array/

https://leetcode-cn.com/problems/search-a-2d-matrix/

https://leetcode-cn.com/problems/find-minimum-in-rotated-sorted-array/

使用二分查找,寻找一个半有序数组 [4, 5, 6, 7, 0, 1, 2] 中间无序的地方

说明:同学们可以将自己的思路、代码写在第 4 周的学习总结中

第4周作业

简单:

https://leetcode-cn.com/problems/lemonade-change/description/

https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-ii/description/

https://leetcode-cn.com/problems/assign-cookies/description/

https://leetcode-cn.com/problems/walking-robot-simulation/description/

使用二分查找,寻找一个半有序数组 [4, 5, 6, 7, 0, 1, 2] 中间无序的地方

说明:同学们可以将自己的思路、代码写在第 3 周的学习总结中

中等:

https://leetcode-cn.com/problems/word-ladder/description/

https://leetcode-cn.com/problems/number-of-islands/

https://leetcode-cn.com/problems/minesweeper/description/

https://leetcode-cn.com/problems/jump-game/

https://leetcode-cn.com/problems/search-in-rotated-sorted-array/

https://leetcode-cn.com/problems/search-a-2d-matrix/

https://leetcode-cn.com/problems/find-minimum-in-rotated-sorted-array/

困难

https://leetcode-cn.com/problems/word-ladder-ii/description/

https://leetcode-cn.com/problems/jump-game-ii/

第 6 周预习

预习知识点:

动态规划定义

初识动态规划:如何巧妙解决“双十一”购物时的凑单问题?

动态规划理论:一篇文章带你彻底搞懂最优子结构、无后效性和重复子问题

动态规划实战:如何实现搜索引擎中的拼写纠错功能?

预习题目:

最长公共子序列题目

三角形最小路径和

最大子序和

打家劫舍