课程规划安排
第一阶段：求职规划
早报名，早规划，早准备。从报名第一天开始，1对1制定详细求职规划。
-
• 报名开始: 1对1评估诊断、1对1项目推荐、1对1求职规划
-
• 立即开课《算法基础知识（上）（下）》《LeetCode 1-900讲解》《规划总结》
第二阶段：算法基础训练
以面试为目的的算法基础训练，梳理面试核心考点，夯实基础，助力进阶
-
• 第一周：位运算，数学题1对1电话监督
-
• 第二周：数组1对1电话监督周测试
-
• 第三周：二分查找，链表，随机1对1电话监督
-
• 第四周：栈，字符串1对1电话监督周测试
-
• 第五周：复习总结用户调查1对1模拟面试代码提交内训直播
第三阶段：算法提升训练
算法进阶能力提升训练，全面覆盖从简单到困难面试题型分类讲解
-
• 第六周：图形，堆1对1电话监督
-
• 第七周：回溯法，图1对1电话监督周测试
-
• 第八周：树，字典树，线段树，树状数组1对1电话监督
-
• 第九周：贪心，设计，动态规划1对1电话监督周测试
-
• 第十周：复习总结用户调查1对1模拟面试代码提交内训直播
第四阶段：设计能力提升
从设计能力基础入手，理论与实践并重，完整覆盖大厂面试全部能力要求。
-
• 第十一周至第十二周：OOD 面向对象设计1对1电话监督周测试
-
• 第十三周至第十四周：System Design 系统设计1对1电话监督周测试
-
• 第十五周：复习总结用户调查代码提交内训直播成绩总结
第五阶段： 面试准备
修改简历，1对1面试，总结并公布成绩
-
• 第十六周：面试准备1对1简历修改1对1模拟面试
第六阶段：求职咨询服务
冲刺营结束后，长达八个月1对1求职咨询服务，解决你求职面试过程中一切问题
-
• 8个月：1对1求职咨询服务期
课程 目录
CSON每周规划总结
课程总时长: 5小时
展开
-
第一章 开课必看收起
-
1-1 开课必看 26:47
-
-
第二章 每周任务规划总结收起
-
2-1 第一周任务规划 01:45
-
2-2 第一周任务总结：位运算，数学题 20:51
-
2-3 第二周任务规划 02:44
-
2-4 第二周任务总结：数组 33:12
-
2-5 第三周任务规划 02:32
-
2-6 第三周任务总结：二分查找，链表，随机 20:37
-
2-7 第四周任务规划 02:28
-
2-8 第四周任务总结：栈，字符串 14:25
-
2-9 第六周任务规划 04:22
-
2-10 第六周任务总结：图形，堆 14:04
-
2-11 第七周任务规划 03:29
-
2-12 第七周任务总结：回溯法，图 18:08
-
2-13 第八周任务规划 02:48
-
2-14 第八周：树，字典树，线段树，树状数组 15:15
-
2-15 第九周任务规划 04:11
-
2-16 第九周：贪心，设计，动态规划 17:05
-
-
第三章 面试技巧指导展开
-
3-1 面试流程——实习全职 13:56
-
3-2 面试内容和流程 09:48
-
3-3 题意 06:52
-
3-4 输入输出，命名 06:15
-
3-5 做题注意事项 20:17
-
3-6 复杂度 & Case 02:54
-
-
第四章 简历修改指导展开
-
4-1 简历的组成 12:35
-
4-2 LaTeX 02:53
-
4-3 Contact & Education 09:49
-
4-4 Experience & Project 08:06
-
4-5 Skills & 注意事项 06:15
-
4-6 如何吹牛 14:52
-
4-7 面试 02:40
-
课程 目录
Java 零基础快速入门
课程总时长: 5小时
展开
-
第一章 Java 介绍收起
-
1-1 Java 和 Java 开发工具介绍 17:39
-
-
第二章 Java 基础语法收起
-
2-1 Java 常用概念 14:24
-
2-2 Java 流程控制 26:35
-
2-3 Java 运算符 11:25
-
2-4 Java 的数组 11:35
-
2-5 Java 的函数 15:38
-
2-6 值传递和引用传递 14:36
-
2-7 面向对象和构造函数 33:34
-
-
第三章 Java 特性展开
-
3-1 Java 三大特性：封装 19:54
-
3-2 Java 三大特性：继承 09:56
-
3-3 重写和访问修饰符 08:33
-
3-4 final 和填坑 13:12
-
3-5 Java 三大特性：多态 12:38
-
3-6 接口 11:41
-
3-7 抽象和内部类 13:52
-
-
第四章 异常处理展开
-
4-1 异常介绍 09:01
-
4-2 异常处理 - try catch finally 09:56
-
4-3 异常处理 throws throw 08:00
-
4-4 自定义异常 03:39
-
-
第五章 结束语展开
-
5-1 结束（范型和 IDE Debug） 06:24
-
课程 目录
-
第一章 课程介绍收起
-
1-1 课程介绍 15:06
-
1-2 如何最快速的刷题 18:06
-
1-3 刷题常见问题 17:40
-
1-4 Java 编程风格 41:24
-
-
第二章 算法，时间 & 空间复杂度收起
-
2-1 算法和数据结构 28:01
-
2-2 时间复杂度 24:37
-
2-3 空间复杂度 10:10
-
-
第三章 算法必备基础展开
-
3-1 数据量级 17:12
-
3-2 递归 11:03
-
3-3 递归的时间和空间复杂度 08:13
-
3-4 重复调用怎么办 16:20
-
3-5 迭代 04:37
-
3-6 分治法 17:45
-
3-7 特殊的时间和空间复杂度 14:54
-
-
第四章 数组展开
-
4-1 数组介绍 13:50
-
4-2 实现数组 - 基本方法 12:41
-
4-3 实现数组 - 增加 09:50
-
4-4 实现数组 - 查找 01:52
-
4-5 实现数组 - 修改 02:35
-
4-6 实现数组 - 删除 07:40
-
4-7 实现数组 - 优化和测试 09:38
-
4-8 数组的时间复杂度 04:02
-
4-9 数组动态化 + Lazy 思想 12:06
-
4-10 均摊时间 VS 平均时间 06:05
-
4-11 Java 源码分析 - ArrayList 06:21
-
4-12 Java 源码分析 - add() 13:34
-
4-13 Java 源码分析 - contains & get & set 03:52
-
4-14 Java 源码分析 - remove() 04:37
-
4-15 Leetcode 相关题目 05:49
-
-
第五章 基于比较的排序算法展开
-
5-1 排序算法 03:02
-
5-2 冒泡排序 24:28
-
5-3 排序算法的稳定性 13:05
-
5-4 类中比较 Comparable 和 Comparator 07:15
-
5-5 Leetcode 中的冒泡排序 05:01
-
5-6 选择排序 09:04
-
5-7 Leetcode 中的选择排序 04:03
-
5-8 插入排序 07:11
-
5-9 插入排序的二分优化 10:21
-
5-10 Leetcode 中的插入排序 07:20
-
5-11 合并排序 05:11
-
5-12 Leetcode 中的合并排序 04:24
-
5-13 快速排序 25:44
-
5-14 Leetcode 中的快速排序 12:18
-
-
第六章 非比较的排序算法和 Java 数组相关源码展开
-
6-1 计数排序 12:49
-
6-2 Leetcode 中的计数排序 04:28
-
6-3 桶排序 17:31
-
6-4 Leetcode 中的桶排序 15:32
-
6-5 排序算法总结和荷兰国旗问题 10:41
-
6-6 Java 源码 Collections 集合 06:34
-
6-7 Java 源码 Arrays 方法 06:33
-
6-8 Java 源码 Arrays.sort 分析 15:27
-
6-9 Arrays.sort 比较 08:28
-
-
第七章 链表展开
-
7-1 什么是链表 15:25
-
7-2 链表的插入 15:04
-
7-3 链表的删除 12:15
-
7-4 链表的更改 05:45
-
7-5 链表的查找 03:01
-
7-6 范型的更改 08:13
-
7-7 时间复杂度和测试 06:38
-
7-8 静态，双向，循环，双向循环链表 05:43
-
7-9 Java 源码 LinkedList - add 方法 13:26
-
7-10 Java 源码 LinkedList - remove 方法 10:17
-
7-11 Java 源码 LinkedList - get 和 set 方法 04:14
-
7-12 Java 源码接口 List 14:07
-
7-13 ArrayList VS LinkedList 08:27
-
-
第八章 栈展开
-
8-1 栈的介绍 05:38
-
8-2 顺序栈的简单实现 10:05
-
8-3 顺序栈的具体实现 11:14
-
8-4 链式栈的具体实现 11:11
-
8-5 Java 源码分析 Stack 和 Vector VS ArrayList 17:32
-
8-6 栈和递归 12:36
-
8-7 递归转化迭代 11:15
-
8-8 Leetcode 中的 Stack 19:49
-
8-9 题型讲解 00:48
-
-
第九章 队列展开
-
9-1 什么是队列 03:43
-
9-2 Deque Queue Stack 09:25
-
9-3 Java 源码分析 Queue Deque 12:47
-
9-4 链表实现队列代码实现 09:14
-
9-5 数组实现队列 12:01
-
9-6 循环队列介绍 08:05
-
9-7 循环队列的代码实现 14:43
-
9-8 Java 源码 ArrayDeque 分析 11:07
-
9-9 Leetcode 中的 Queue 和 Stack 13:36
-
9-10 队列的应用 02:21
-
课程 目录
算法基础知识（下）
课程总时长: 18小时
展开
-
第一章 课程介绍收起
-
1-1 课程介绍 15:06
-
-
第二章 散列表基础知识收起
-
2-1 HashTable HashMap HashSet 简介 21:15
-
2-2 直接寻址表和散列表 05:07
-
2-3 散列函数 08:42
-
2-4 链接法 05:37
-
2-5 碰撞过多怎么办 03:16
-
2-6 开放地址法 03:29
-
2-7 再哈希法和小结 03:54
-
-
第三章 散列表代码实现展开
-
3-1 hashCode 和 equals 11:12
-
3-2 链接法代码 23:59
-
3-3 开放定址法代码实现 19:01
-
3-4 HashTable 源码分析 18:06
-
3-5 HashMap 源码分析 43:44
-
3-6 HashSet 源码分析 08:26
-
3-7 LinkedHashMap 简介 13:40
-
3-8 Leetcode 实战练习题 30:23
-
3-9 Bloom Filter 布隆过滤器 04:58
-
3-10 Bloom Filter 布隆过滤器代码实现 13:37
-
3-11 做题须知 02:41
-
-
第四章 堆展开
-
4-1 堆的介绍 12:50
-
4-2 保持堆的性质 16:44
-
4-3 其他函数的实现 11:38
-
4-4 Heapify 过程 12:55
-
4-5 堆排序 12:30
-
4-6 排序算法时间下界 06:56
-
4-7 PriorityQueue 源码分析 15:22
-
4-8 索引堆 05:23
-
4-9 索引堆应用 11:57
-
-
第五章 图展开
-
5-1 图 09:39
-
5-2 图的表示 16:43
-
5-3 深度优先搜索原理 07:45
-
5-4 DFS 递归代码实现1 18:56
-
5-5 DFS 递归代码实现2 07:33
-
5-6 迭代代码实现 12:33
-
5-7 DFS 复杂度分析 07:03
-
5-8 广度优先搜索原理 03:32
-
5-9 BFS 代码实现 13:01
-
5-10 代码实现和 BFS 复杂度分析 07:23
-
5-11 遍历应用和实战演练 15:30
-
-
第六章 拓扑排序展开
-
6-1 拓扑排序 10:46
-
6-2 DFS 实现拓扑排序 06:04
-
6-3 DFS 拓扑排序代码实现 16:02
-
6-4 BFS 实现拓扑排序 08:42
-
6-5 BFS 拓扑排序代码实现 09:14
-
6-6 拓扑排序复杂度 02:42
-
-
第七章 并查集展开
-
7-1 Union Find 简介 06:43
-
7-2 Quick Find 实现 17:30
-
7-3 Quick Union 实现 10:12
-
7-4 Union Find 两种优化方式 08:40
-
7-5 Union Find 总结 13:42
-
-
第八章 最小生成树展开
-
8-1 最小生成树介绍 04:00
-
8-2 Prim 算法介绍 08:44
-
8-3 边，图代码实现 08:03
-
8-4 Prim 代码实现 29:38
-
8-5 Kruskal 算法介绍 08:57
-
8-6 Kruskal 代码实现 06:55
-
-
第九章 最短路径展开
-
9-1 最短路径介绍 05:46
-
9-2 Dijkstra 原理 09:11
-
9-3 Dijkstra 算法实现1 16:42
-
9-4 Dijkstra 算法实现2 08:22
-
9-5 Dijkstra 时间复杂度 04:35
-
9-6 Bellman-Ford 算法原理 20:56
-
9-7 Bellman-Ford 代码实现 07:34
-
9-8 Floyd-Warshall 算法介绍 13:27
-
9-9 图的总结 03:42
-
-
第十章 树展开
-
10-1 树的概念 12:50
-
10-2 先序遍历 20:55
-
10-3 中序遍历 14:53
-
10-4 后序遍历 13:20
-
10-5 层次遍历 16:26
-
10-6 二叉树表示——链表形式 11:18
-
10-7 二叉查找树 09:10
-
10-8 二叉查找树的插入 10:46
-
10-9 二叉查找树的查询 05:30
-
10-10 二叉查找树的删除 10:13
-
10-11 补充和小结 02:42
-
-
第十一章 AVL树展开
-
11-1 AVL树 09:49
-
11-2 AVL树实现 25:13
-
11-3 AVL 的 LL 和 RR 15:23
-
11-4 AVL 的 LL 和 RR 代码实现 09:38
-
11-5 AVL 的 LR 和 RL 代码实现 15:16
-
11-6 AVL的删除和包含 09:54
-
-
第十二章 红黑树展开
-
12-1 2-3树 12:25
-
12-2 2-3树与红黑树 06:48
-
12-3 基础代码 12:36
-
12-4 红黑树的加入 09:43
-
12-5 旋转，颜色反转颜色代码 08:08
-
12-6 插入代码实现 06:51
-
12-7 红黑树测试和总结 25:25
-
12-8 Java 中的红黑树——TreeMap 12:48
-
12-9 TreeMap 中的特有函数 13:26
-
-
第十三章 结束语展开
-
13-1 结束语 10:09
-
课程 目录
-
第一章 课程介绍收起
-
1-1 课程介绍 17:11
-
-
第二章 位运算收起
-
2-1 二进制 11:10
-
2-2 Java 八大基本类型 09:29
-
2-3 位运算 10:23
-
2-4 编码标准 10:44
-
2-5 面试技巧1 - XOR 07:28
-
2-6 面试技巧2 - n&(n - 1) 05:33
-
2-7 面试技巧3 - n&1 04:05
-
2-8 数据量过大怎么办 17:53
-
2-9 BitMap 应用 14:41
-
2-10 Leetcode作业题和思维导图 01:14
-
-
第三章 数学题展开
-
3-1 数学题概括 02:32
-
3-2 考察要点1 - 越界 10:28
-
3-3 考察要点2 - 进位 05:13
-
3-4 考察要点3 - 符号字母 08:11
-
3-5 常考题型 - 开方（牛顿法） 14:39
-
3-6 特殊题型和必背代码 03:00
-
3-7 Leetcode作业题和思维导图 01:44
-
-
第四章 数组题展开
-
4-1 常考题型 1 - 排序算法补充 10:38
-
4-2 常考题型 2 - 单向双指针 08:19
-
4-3 扫描线算法 11:13
-
4-4 子数组 - 进行中处理 16:17
-
4-5 子数组 - 分段式处理 13:34
-
4-6 双指针 - 双向双指针 06:05
-
4-7 常考题型 3 - 二维数组 22:22
-
4-8 二维矩阵 - 旋转变换 12:16
-
4-9 常考题型4 - 实现题 10:33
-
4-10 数学定理 06:14
-
4-11 Leetcode作业题和思维导图 05:56
-
-
第五章 二分查找展开
-
5-1 二分查找 04:41
-
5-2 递归写法 07:30
-
5-3 迭代写法 1：left <= right 14:01
-
5-4 迭代写法 2：left < right 10:09
-
5-5 迭代写法 3：left + 1< right 10:26
-
5-6 Java 源码中的二分查找 04:46
-
5-7 三种方法应用 14:53
-
5-8 Rotate题型 12:25
-
5-9 Rotate题型 follow up 05:14
-
5-10 二维数组 12:06
-
5-11 Leetcode作业题和思维导图 03:08
-
-
第六章 链表展开
-
6-1 链表题型介绍 03:24
-
6-2 常考题型 1 - 基本操作 29:31
-
6-3 常考题型 2 - 反转 16:41
-
6-4 常考题型 3 - 环 16:30
-
6-5 常考题型 4 - 删除 20:56
-
6-6 链表的递归实现 14:13
-
6-7 综合练习 12:33
-
6-8 Leetcode作业题和思维导图 02:35
-
-
第七章 随机展开
-
7-1 等概率抽取法 13:48
-
7-2 Leetcode 中的等概率抽取法 25:33
-
7-3 蓄水池抽样1 - 选取一个 12:27
-
7-4 蓄水池抽样2 - 选取多个 12:01
-
7-5 蓄水池算法3 - 代码实现 12:34
-
7-6 Leetcode作业题和思维导图 02:32
-
-
第八章 栈展开
-
8-1 常考题型1 - 平衡符号 11:24
-
8-2 常考题型2 - 压栈匹配1 15:15
-
8-3 常考题型2 - 压栈匹配2 25:01
-
8-4 常考题型3 - 表达式计算1 16:35
-
8-5 常考题型3 - 表达式计算2 06:37
-
8-6 常考题型4 - 迭代极值1 31:05
-
8-7 常考题型4 - 迭代极值2 18:50
-
8-8 Leetcode 400题作业，思维导图 03:34
-
-
第九章 字符串展开
-
9-1 String 基本函数 33:24
-
9-2 字符串函数时间复杂度 17:04
-
9-3 正则表达式 08:37
-
9-4 转义字符 & 通配符 09:00
-
9-5 String VS StringBuilder VS StringBuffer 14:27
-
9-6 常考题型1 - Anagram 07:55
-
9-7 常考题型2 - Substring 21:19
-
9-8 常考题型3 - Parentheses 17:28
-
9-9 常考题型4 - Palindrome 10:16
-
9-10 常考题型5 - Subsequence 05:41
-
9-11 常考题型6 -实现题 07:07
-
9-12 Leetcode 400题作业，思维导图 05:10
-
-
第十章 图形展开
-
10-1 图形题简介 10:05
-
10-2 点在线段上 16:17
-
10-3 三点方向 06:54
-
10-4 点在直线上 20:56
-
10-5 点与面的关系 14:51
-
10-6 线段是否相交 17:37
-
10-7 点是否在多边形内 20:41
-
10-8 圆简介 09:13
-
10-9 方格与圆 13:19
-
10-10 圆与三角形 08:45
-
10-11 多边形考点 06:26
-
10-12 二分图 27:51
-
10-13 正方形 25:08
-
10-14 长方形 05:09
-
10-15 不平行于x轴怎么办 18:41
-
10-16 三角形和小结 09:07
-
课程 目录
题型技巧总结（下）
课程总时长: 15小时
展开
-
第一章 课程介绍收起
-
1-1 课程介绍 17:11
-
-
第二章 堆收起
-
2-1 PriorityQueue 写法介绍 16:22
-
2-2 全排序 VS 局部排序 11:49
-
2-3 Arrays.sort 应用 10:35
-
2-4 Pair 和时间复杂度 21:57
-
2-5 类的应用——外排序 15:48
-
2-6 Leetcode 作业题和思维导图 01:31
-
-
第三章 回溯法展开
-
3-1 回溯概念 06:46
-
3-2 回溯三大题型——排列 37:51
-
3-3 回溯三大题型——子集 13:30
-
3-4 回溯三大题型——组合 11:29
-
3-5 模版和值传递 04:02
-
3-6 回溯法的实现题 22:46
-
3-7 Leetcode 作业题和思维导图 02:03
-
-
第四章 图展开
-
4-1 图的基础回顾 05:15
-
4-2 Flood Fill 的 DFS 14:32
-
4-3 Flood Fill 的 BFS 10:15
-
4-4 BFS 最终优化 07:31
-
4-5 迷宫，棋盘怎么破 19:42
-
4-6 双向广度搜索 09:37
-
4-7 思考方式——转换图 20:53
-
4-8 匹配 05:35
-
4-9 匈牙利算法原理 08:34
-
4-10 匈牙利算法实现 24:55
-
4-11 Leetcode 作业题和思维导图 02:59
-
-
第五章 树展开
-
5-1 树的第一想法 04:02
-
5-2 双 Pre 题目和解法 05:36
-
5-3 Inorder 题目和解法 05:26
-
5-4 Postorder 题目和解法 20:46
-
5-5 Levelorder 题目和解法 07:12
-
5-6 Preorder 和 Backtracking 12:47
-
5-7 二叉搜索树 05:45
-
5-8 Leetcode 作业题和思维导图 02:21
-
-
第六章 字典树展开
-
6-1 Trie 介绍 09:32
-
6-2 TrieNode 12:05
-
6-3 add() 和 contains() 函数 08:57
-
6-4 前缀树——startsWith() 函数 05:29
-
6-5 字符匹配——search() 函数 08:27
-
6-6 字典结合 23:07
-
6-7 Leetcode 作业题和思维导图 01:46
-
-
第七章 线段树 和 树状数组展开
-
7-1 Segment Tree 和 Binary Index Tree 08:59
-
7-2 线段树原理 06:50
-
7-3 SegmentTreeNode 实现 Segment Tree 21:17
-
7-4 数组实现 Segment Tree 19:28
-
7-5 lazy 思想 03:06
-
7-6 Binary Index Tree 原理 09:39
-
7-7 实现 Binary Index Tree 22:11
-
7-8 BIT 和 ST 对比 01:43
-
7-9 Leetcode 作业题和思维导图 01:27
-
-
第八章 贪心算法展开
-
8-1 贪心算法——贪心思想 16:07
-
8-2 贪心算法解法步骤 15:42
-
8-3 贪心的局限性 07:49
-
8-4 Leetcode 作业题和思维导图 01:35
-
-
第九章 设计展开
-
9-1 设计介绍——10种数据结构 07:42
-
9-2 HashSet VS HashMap 06:40
-
9-3 ArrayList VS LinkedList 14:02
-
9-4 Stack VS Queue VS Deque 15:48
-
9-5 TreeSet VS TreeMap VS PriorityQueue 13:34
-
9-6 设置 Class 08:47
-
9-7 做题思想和做题流程总结 13:59
-
9-8 Leetcode 作业题和思维导图 01:40
-
-
第十章 动态规划展开
-
10-1 如何推到出动态规划 23:00
-
10-2 Backtracking - Memorization - DP（1） 20:53
-
10-3 Backtracking - Memorization - DP（2） 12:34
-
10-4 三种方法小结 12:12
-
10-5 状态和状态转移方程 06:47
-
10-6 动态规划做题思路 18:59
-
10-7 01背包问题 33:30
-
10-8 01背包问题分析及其优化 16:23
-
10-9 完全背包——两种解决方法 12:13
-
10-10 多重背包和混合背包 05:28
-
10-11 字符串问题 14:26
-
10-12 网格问题 07:56
-
10-13 匹配问题 14:46
-
10-14 follow up —— 打印中间过程 11:07
-
10-15 贪心算法和动态规划 03:10
-
10-16 Leetcode 作业题和思维导图 01:36
-
-
第十一章 结束语展开
-
11-1 结束语 04:25
-
课程 目录
-
第一章 课程介绍收起
-
1-1 课程介绍 04:38
-
-
第二章 Leetcode 1 - 50收起
-
1. Two Sum 05:55
-
2. Add Two Numbers 05:48
-
3. Longest Substring Without Repeating Characters 09:25
-
4. Median of Two Sorted Arrays 27:02
-
5. Longest Palindromic Substring 13:38
-
6. ZigZag Conversion 13:15
-
7. Reverse Integer 04:09
-
8. String to Integer (atoi) 08:57
-
9. Palindrome Number 04:14
-
10. Regular Expression Matching 20:50
-
11. Container With Most Water 05:07
-
12. Integer to Roman 02:34
-
13. Roman to Integer 06:01
-
14. Longest Common Prefix 13:09
-
15. 3Sum 12:56
-
16. 3Sum Closest 06:48
-
17. Letter Combinations of a Phone Number 15:02
-
18. 4Sum 06:27
-
19. Remove Nth Node From End of List 05:01
-
20. Valid Parentheses 06:38
-
21. Merge Two Sorted Lists 04:07
-
22. Generate Parentheses 05:30
-
23. Merge k Sorted Lists 15:12
-
24. Swap Nodes in Pairs 05:06
-
25. Reverse Nodes in k-Group 06:25
-
26. Remove Duplicates from Sorted Array 04:51
-
27. Remove Element 03:14
-
28. Implement strStr() 04:20
-
29. Divide Two Integers 13:57
-
30. Substring with Concatenation of All Words 11:55
-
31. Next Permutation 08:53
-
32. Longest Valid Parentheses 11:00
-
33. Search in Rotated Sorted Array 06:58
-
34. Search for a Range 06:36
-
35. Search Insert Position 06:29
-
36. Valid Sudoku 22:30
-
37. Sudoku Solver 09:28
-
38. Count and Say 13:33
-
39. Combination Sum 03:51
-
40. Combination Sum II 05:59
-
41. First Missing Positive 15:03
-
42. Trapping Rain Water 11:45
-
43. Multiply Strings 14:47
-
44. Wildcard Matching 10:22
-
45. Jump Game II 13:35
-
46. Permutations 09:47
-
47. Permutations II 15:21
-
48. Rotate Image 07:48
-
49. Group Anagrams 10:56
-
50. Pow(x, n) 10:58
-
-
第三章 Leetcode 51 - 100展开
-
51. N-Queens 28:15
-
52. N-Queens II 14:10
-
53. Maximum Subarray 07:57
-
54. Spiral Matrix 09:39
-
55. Jump Game 05:31
-
56. Merge Intervals 11:11
-
57. Insert Interval 06:57
-
58. Length of Last Word 02:13
-
59. Spiral Matrix II 06:13
-
60. Permutation Sequence 11:10
-
61. Rotate List 04:57
-
62. Unique Paths 18:33
-
63. Unique Paths II 03:03
-
64. Minimum Path Sum 06:20
-
65. Valid Number 11:31
-
66. Plus One 02:38
-
67. Add Binary 04:12
-
68. Text Justification 14:04
-
69. Sqrt(x) 06:41
-
70. Climbing Stairs 08:27
-
71. Simplify Path 07:12
-
72. Edit Distance 13:33
-
73. Set Matrix Zeroes 10:41
-
74. Search a 2D Matrix 06:07
-
75. Sort Colors 06:46
-
76. Minimum Window Substring 13:23
-
77. Combinations 03:55
-
78. Subsets 05:39
-
79. Word Search 11:07
-
80. Remove Duplicates from Sorted Array II 04:26
-
81. Search in Rotated Sorted Array II 07:13
-
82. Remove Duplicates from Sorted List II 07:05
-
83. Remove Duplicates from Sorted List 03:18
-
84. Largest Rectangle in Histogram 13:11
-
85. Maximal Rectangle 31:49
-
86. Partition List 06:06
-
87. Scramble String 10:50
-
88. Merge Sorted Array 06:06
-
89. Gray Code 04:41
-
90. Subsets II 03:12
-
91. Decode Ways 20:56
-
92. Reverse Linked List II 03:45
-
93. Restore IP Addresses 09:21
-
94. Binary Tree Inorder Traversal 08:50
-
95. Unique Binary Search Trees II 11:41
-
96. Unique Binary Search Trees 04:11
-
97. Interleaving String 08:54
-
98. Validate Binary Search Tree 04:22
-
99. Recover Binary Search Tree 06:12
-
100. Same Tree 03:52
-
-
第四章 Leetcode 101 - 150展开
-
101. Symmetric Tree 02:23
-
102. Binary Tree Level Order Traversal 08:37
-
103. Binary Tree Zigzag Level Order Traversal 05:02
-
104. Maximum Depth of Binary Tree 04:53
-
105. Construct Binary Tree from Preorder and Inorder Traversal 13:14
-
106. Construct Binary Tree from Inorder and Postorder Traversal 15:17
-
107. Binary Tree Level Order Traversal II 07:19
-
108. Convert Sorted Array to Binary Search Tree 05:12
-
109. Convert Sorted List to Binary Search Tree 04:40
-
110. Balanced Binary Tree 04:55
-
111. Minimum Depth of Binary Tree 02:55
-
112. Path Sum 03:44
-
113. Path Sum II 07:33
-
114. Flatten Binary Tree to Linked List 10:29
-
115. Distinct Subsequences 08:56
-
116. Populating Next Right Pointers in Each Node 09:55
-
117. Populating Next Right Pointers in Each Node II 11:10
-
118. Pascal's Triangle 07:47
-
119. Pascal's Triangle II 03:01
-
120. Triangle 10:06
-
121. Best Time to Buy and Sell Stock 03:50
-
122. Best Time to Buy and Sell Stock II 02:28
-
123. Best Time to Buy and Sell Stock III 06:54
-
124. Binary Tree Maximum Path Sum 07:41
-
125. Valid Palindrome 02:37
-
126. Word Ladder II 43:02
-
127. Word Ladder 21:39
-
128. Longest Consecutive Sequence 06:14
-
129. Sum Root to Leaf Numbers 04:21
-
130. Surrounded Regions 09:00
-
131. Palindrome Partitioning 08:09
-
132. Palindrome Partitioning II 11:25
-
133. Clone Graph 19:02
-
134. Gas Station 11:00
-
135. Candy 08:15
-
136. Single Number 03:34
-
137. Single Number II 12:35
-
138. Copy List with Random Pointer 18:11
-
139. Word Break 09:41
-
140. Word Break II 17:10
-
141. Linked List Cycle 03:28
-
142. Linked List Cycle II 06:51
-
143. Reorder List 09:13
-
144. Binary Tree Preorder Traversal 06:40
-
145. Binary Tree Postorder Traversal 06:32
-
146. LRU Cache 29:50
-
147. Insertion Sort List 09:16
-
148. Sort List 06:58
-
149. Max Points on a Line 13:06
-
150. Evaluate Reverse Polish Notation 05:11
-
-
第五章 Leetcode 151 - 200展开
-
151. Reverse Words in a String 03:48
-
152. Maximum Product Subarray 08:35
-
153. Find Minimum in Rotated Sorted Array 06:56
-
154. Find Minimum in Rotated Sorted Array II 06:45
-
155. Min Stack 11:37
-
156. Binary Tree Upside Down 03:38
-
157. Read N Characters Given Read4 13:17
-
158. Read N Characters Given Read4 II - Call multiple times 12:25
-
159. Longest Substring with At Most Two Distinct Characters 08:26
-
160. Intersection of Two Linked Lists 11:03
-
161. One Edit Distance 05:40
-
162. Find Peak Element 04:38
-
163. Missing Ranges 12:16
-
164. Maximum Gap 20:50
-
165. Compare Version Numbers 04:32
-
166. Fraction to Recurring Decimal 13:33
-
167. Two Sum II - Input array is sorted 04:26
-
168. Excel Sheet Column Title 03:51
-
169. Majority Element 07:40
-
170. Two Sum III - Data structure design 10:22
-
171. Excel Sheet Column Number 02:17
-
172. Factorial Trailing Zeroes 03:46
-
173. Binary Search Tree Iterator 04:30
-
174. Dungeon Game 10:11
-
179. Largest Number 08:31
-
186. Reverse Words in a String II 05:17
-
187. Repeated DNA Sequences 05:06
-
188. Best Time to Buy and Sell Stock IV 08:31
-
189. Rotate Array 06:49
-
190. Reverse Bits 04:18
-
191. Number of 1 Bits 06:33
-
198. House Robber 06:39
-
199. Binary Tree Right Side View 07:27
-
200. Number of Islands 22:44
-
-
第六章 Leetcode 201 - 250展开
-
201. Bitwise AND of Numbers Range 04:53
-
202. Happy Number 04:34
-
203. Remove Linked List Elements 07:28
-
204. Count Primes 05:14
-
205. Isomorphic Strings 12:55
-
206. Reverse Linked List 05:52
-
207. Course Schedule 14:03
-
208. Implement Trie (Prefix Tree) 08:44
-
209. Minimum Size Subarray Sum 07:40
-
210. Course Schedule II 07:05
-
211. Add and Search Word - Data structure design 20:09
-
212. Word Search II 13:30
-
213. House Robber II 03:12
-
214. Shortest Palindrome 07:44
-
215. Kth Largest Element in an Array 19:32
-
216. Combination Sum III 03:30
-
217. Contains Duplicate 03:07
-
218. The Skyline Problem 28:42
-
219. Contains Duplicate II 02:54
-
220. Contains Duplicate III 24:36
-
221. Maximal Square 05:58
-
222. Count Complete Tree Nodes 09:20
-
223. Rectangle Area 07:01
-
224. Basic Calculator 10:06
-
225. Implement Stack using Queues 05:11
-
226. Invert Binary Tree 07:28
-
227. Basic Calculator II 22:09
-
228. Summary Ranges 05:37
-
229. Majority Element II 12:29
-
230. Kth Smallest Element in a BST 03:25
-
231. Power of Two 01:47
-
232. Implement Queue using Stacks 15:24
-
233. Number of Digit One 06:33
-
234. Palindrome Linked List 07:01
-
235. Lowest Common Ancestor of a Binary Search Tree 02:41
-
236. Lowest Common Ancestor of a Binary Tree 05:42
-
237. Delete Node in a Linked List 01:32
-
238. Product of Array Except Self 06:42
-
239. Sliding Window Maximum 17:01
-
240. Search a 2D Matrix II 05:14
-
241. Different Ways to Add Parentheses 11:39
-
242. Valid Anagram 04:15
-
243. Shortest Word Distance 05:42
-
244. Shortest Word Distance II 06:50
-
245. Shortest Word Distance III 02:36
-
246. Strobogrammatic Number 04:32
-
247. Strobogrammatic Number II 08:54
-
248. Strobogrammatic Number III 11:30
-
249. Group Shifted Strings 10:17
-
250. Count Univalue Subtrees 07:12
-
-
第七章 Leetcode 251 - 300展开
-
251. Flatten 2D Vector 05:04
-
252. Meeting Rooms 03:05
-
253. Meeting Rooms II 22:25
-
254. Factor Combinations 03:19
-
255. Verify Preorder Sequence in Binary Search Tree 09:10
-
256. Paint House 06:23
-
257. Binary Tree Paths 04:43
-
258. Add Digits 04:17
-
259. 3Sum Smaller 05:19
-
260. Single Number III 07:26
-
261. Graph Valid Tree 18:52
-
263. Ugly Number 04:47
-
264. Ugly Number II 09:58
-
265. Paint House II 11:32
-
266. Palindrome Permutation 06:39
-
267. Palindrome Permutation II 13:38
-
268. Missing Number 07:14
-
269. Alien Dictionary 19:15
-
270. Closest Binary Search Tree Value 04:59
-
271. Encode and Decode Strings 07:07
-
272. Closest Binary Search Tree Value II 27:52
-
273. Integer to English Words 11:56
-
274. H-Index 15:01
-
275. H-Index II 04:03
-
276. Paint Fence 04:59
-
277. Find the Celebrity 06:43
-
278. First Bad Version 05:35
-
279. Perfect Squares 05:42
-
280. Wiggle Sort 05:56
-
281. Zigzag Iterator 14:30
-
282. Expression Add Operators 13:44
-
283. Move Zeroes 09:31
-
284. Peeking Iterator 04:10
-
285. Inorder Successor in BST 05:08
-
286. Walls and Gates 12:20
-
287. Find the Duplicate Number 12:24
-
288. Unique Word Abbreviation 08:55
-
289. Game of Life 14:42
-
290. Word Pattern 06:45
-
291. Word Pattern II 17:44
-
292. Nim Game 02:36
-
293. Flip Game 03:29
-
294. Flip Game II 07:28
-
295. Find Median from Data Stream 11:12
-
296. Best Meeting Point 16:19
-
297. Serialize and Deserialize Binary Tree 07:20
-
298. Binary Tree Longest Consecutive Sequence 05:41
-
299. Bulls and Cows 06:48
-
300. Longest Increasing Subsequence 28:03
-
课程 目录
LeetCode 题目视频讲解（301-600）
课程总时长: 30小时
展开
-
第一章 课程介绍收起
-
1-1 课程介绍 04:38
-
-
第二章 Leetcode 301 - 350收起
-
301. Remove Invalid Parentheses 23:27
-
302. Smallest Rectangle Enclosing Black Pixels 14:24
-
303. Range Sum Query - Immutable 04:40
-
304. Range Sum Query 2D - Immutable 10:12
-
305. Number of Islands II 18:06
-
306. Additive Number 13:07
-
307, 308. Range Sum Query - Mutable 39:04
-
309. Best Time to Buy and Sell Stock with Cooldown 11:33
-
310. Minimum Height Trees 12:16
-
311. Sparse Matrix Multiplication 04:38
-
312. Burst Balloons 11:23
-
313. Super Ugly Number 12:04
-
314. Binary Tree Vertical Order Traversal 15:41
-
315. Count of Smaller Numbers After Self 07:51
-
316. Remove Duplicate Letters 17:46
-
317. Shortest Distance from All Buildings 23:06
-
318. Maximum Product of Word Lengths 13:49
-
319. Bulb Switcher 05:32
-
320. Generalized Abbreviation 07:10
-
321. Create Maximum Number 20:04
-
322. Coin Change 08:11
-
323. Number of Connected Components in an Undirected Graph 04:25
-
324. Wiggle Sort II 31:28
-
325. Maximum Size Subarray Sum Equals k 12:05
-
326. Power of Three 01:45
-
327. Count of Range Sum 25:00
-
328. Odd Even Linked List 04:34
-
329. Longest Increasing Path in a Matrix 08:46
-
330. Patching Array 12:35
-
331. Verify Preorder Serialization of a Binary Tree 05:27
-
332. Reconstruct Itinerary 11:35
-
333. Largest BST Subtree 15:46
-
334. Increasing Triplet Subsequence 03:16
-
335. Self Crossing 04:44
-
336. Palindrome Pairs 11:05
-
337. House Robber III 14:12
-
338. Counting Bits 05:16
-
339. Nested List Weight Sum 14:40
-
340. Longest Substring with At Most K Distinct Characters 07:08
-
341. Flatten Nested List Iterator 08:30
-
342. Power of Four 03:04
-
343. Integer Break 04:22
-
344. Reverse String 02:44
-
345. Reverse Vowels of a String 03:05
-
346. Moving Average from Data Stream 06:56
-
347. Top K Frequent Elements 23:23
-
348. Design Tic-Tac-Toe 11:19
-
349. Intersection of Two Arrays 16:23
-
350. Intersection of Two Arrays II 08:53
-
-
第三章 Leetcode 351 - 400展开
-
351. Android Unlock Patterns 22:53
-
352. Data Stream as Disjoint Intervals 16:25
-
353. Design Snake Game 20:07
-
354. Russian Doll Envelopes 10:05
-
355. Design Twitter 30:09
-
356. Line Reflection 08:47
-
357. Count Numbers with Unique Digits 04:38
-
358. Rearrange String k Distance Apart 25:51
-
359. Logger Rate Limiter 04:39
-
360. Sort Transformed Array 07:31
-
361. Bomb Enemy 14:00
-
362. Design Hit Counter 13:06
-
363. Max Sum of Rectangle No Larger Than K 38:04
-
364. Nested List Weight Sum II 06:11
-
365. Water and Jug Problem 08:56
-
366. Find Leaves of Binary Tree 08:37
-
367. Valid Perfect Square 12:15
-
368. Largest Divisible Subset 14:00
-
369. Plus One Linked List 12:06
-
370. Range Addition 09:00
-
371. Sum of Two Integers 07:07
-
372. Super Pow 08:02
-
373. Find K Pairs with Smallest Sums 10:22
-
374. Guess Number Higher or Lower 02:16
-
375. Guess Number Higher or Lower II 10:33
-
376. Wiggle Subsequence 10:48
-
377. Combination Sum IV 15:40
-
378. Kth Smallest Element in a Sorted Matrix 17:46
-
379. Design Phone Directory 08:19
-
380. Insert Delete GetRandom O(1) 07:17
-
381. Insert Delete GetRandom O(1) - Duplicates allowed 08:11
-
382. Linked List Random Node 03:31
-
383. Ransom Note 03:30
-
384. Shuffle an Array 04:42
-
385. Mini Parser 09:15
-
386. Lexicographical Numbers 08:40
-
387. First Unique Character in a String 04:26
-
388. Longest Absolute File Path 13:55
-
389. Find the Difference 03:15
-
390. Elimination Game 08:32
-
391. Perfect Rectangle 13:12
-
392. Is Subsequence 03:03
-
393. UTF-8 Validation 13:21
-
394. Decode String 11:57
-
395. Longest Substring with At Least K Repeating Characters 20:07
-
396. Rotate Function 13:31
-
397. Integer Replacement 12:00
-
398. Random Pick Index 03:27
-
399. Evaluate Division 20:49
-
400. Nth Digit 08:56
-
-
第四章 Leetcode 401 - 450展开
-
401. Binary Watch 12:59
-
402. Remove K Digits 12:18
-
403. Frog Jump 11:54
-
404. Sum of Left Leaves 03:59
-
405. Convert a Number to Hexadecimal 04:12
-
406. Queue Reconstruction by Height 07:38
-
407. Trapping Rain Water II 20:48
-
408. Valid Word Abbreviation 06:59
-
409. Longest Palindrome 07:16
-
410. Split Array Largest Sum 19:56
-
411. Minimum Unique Word Abbreviation 15:22
-
412. Fizz Buzz 02:44
-
413. Arithmetic Slices 04:07
-
414. Third Maximum Number 12:34
-
415. Add Strings 05:40
-
416. Partition Equal Subset Sum 09:50
-
417. Pacific Atlantic Water Flow 20:47
-
418. Sentence Screen Fitting 12:14
-
419. Battleships in a Board 04:57
-
420. Strong Password Checker 28:15
-
421. Maximum XOR of Two Numbers in an Array 07:55
-
422. Valid Word Square 05:48
-
423. Reconstruct Original Digits from English 08:20
-
424. Longest Repeating Character Replacement 09:52
-
425. Word Squares 26:08
-
426. Convert Binary Search Tree to Sorted Doubly Linked List 09:43
-
427. Construct Quad Tree 07:01
-
428. Serialize and Deserialize N-ary Tree 09:59
-
429. N-ary Tree Level Order Traversal 03:30
-
430. Flatten a Multilevel Doubly Linked List 05:33
-
431. Encode N-ary Tree to Binary Tree 12:41
-
432. All O`one Data Structure 32:56
-
433. Minimum Genetic Mutation 04:04
-
434. Number of Segments in a String 02:24
-
435. Non-overlapping Intervals 13:11
-
436. Find Right Interval 05:15
-
437. Path Sum III 15:36
-
438. Find All Anagrams in a String 11:04
-
439. Ternary Expression Parser 07:49
-
440. K-th Smallest in Lexicographical Order 14:28
-
441. Arranging Coins 04:31
-
442. Find All Duplicates in an Array 09:13
-
443. String Compression 08:45
-
444. Sequence Reconstruction 17:51
-
445. Add Two Numbers II 11:33
-
446. Arithmetic Slices II - Subsequence 14:23
-
447. Number of Boomerangs 09:17
-
448. Find All Numbers Disappeared in an Array 07:00
-
449. Serialize and Deserialize BST 08:29
-
450. Delete Node in a BST 04:52
-
-
第五章 Leetcode 451 - 500展开
-
451. Sort Characters By Frequency 06:41
-
452. Minimum Number of Arrows to Burst Balloons 08:19
-
453. Minimum Moves to Equal Array Elements 07:14
-
454. 4Sum II 07:55
-
455. Assign Cookies 04:22
-
456. 132 Pattern 06:52
-
457. Circular Array Loop 18:25
-
458. Poor Pigs 11:39
-
459. Repeated Substring Pattern 14:18
-
460. LFU Cache 19:40
-
461. Hamming Distance 02:57
-
462. Minimum Moves to Equal Array Elements II 07:34
-
463. Island Perimeter 06:10
-
464. Can I Win 12:54
-
465. Optimal Account Balancing 19:51
-
466. Count The Repetitions 20:02
-
467. Unique Substrings in Wraparound String 07:47
-
468. Validate IP Address 10:10
-
469. Convex Polygon 10:17
-
470. Implement Rand10() Using Rand7() 15:28
-
471. Encode String with Shortest Length 15:32
-
472. Concatenated Words 10:43
-
473. Matchsticks to Square 10:27
-
474. Ones and Zeroes 08:27
-
475. Heaters 10:52
-
476. Number Complement 03:47
-
477. Total Hamming Distance 06:56
-
478. Generate Random Point in a Circle 13:24
-
479. Largest Palindrome Product 09:32
-
480. Sliding Window Median 17:13
-
481. Magical String 08:41
-
482. License Key Formatting 04:40
-
483. Smallest Good Base 09:55
-
484. Find Permutation 04:28
-
485. Max Consecutive Ones 01:31
-
486. Predict the Winner 15:31
-
487. Max Consecutive Ones II 10:24
-
488. Zuma Game 14:56
-
489. Robot Room Cleaner 12:12
-
490. The Maze 11:52
-
491. Increasing Subsequences 05:30
-
492. Construct the Rectangle 02:29
-
493. Reverse Pairs 09:32
-
494. Target Sum 08:56
-
495. Teemo Attacking 04:32
-
496. Next Greater Element I 07:50
-
497. Random Point in Non-overlapping Rectangles 10:04
-
498. DiagonalTraverse 10:12
-
499. The Maze III 21:55
-
500. Keyboard Row 09:06
-
-
第六章 Leetcode 501 - 550展开
-
501. Find Mode in Binary Search Tree 07:31
-
502. IPO 08:57
-
503. Next Greater Element II 07:35
-
504. Base 7 05:23
-
505. The Maze II 12:48
-
506. Relative Ranks 08:19
-
507. Perfect Number 02:56
-
508. Most Frequent Subtree Sum 06:48
-
509. Fibonacci Number 08:30
-
510. Inorder Successor in BST II 09:50
-
513. Find Bottom Left Tree Value 06:30
-
514. Freedom Trail 19:17
-
515. Find Largest Value in Each Tree Row 02:06
-
516. Longest Palindromic Subsequence 09:52
-
517. Super Washing Machines 11:21
-
518. Coin Change 2 06:14
-
519. Random Flip Matrix 11:23
-
520. Detect Capital 03:22
-
521. Longest Uncommon Subsequence I 01:38
-
522. Longest Uncommon Subsequence II 06:15
-
523. Continuous Subarray Sum 08:29
-
524. Longest Word in Dictionary through Deleting 04:22
-
525. Contiguous Array 07:35
-
526. Beautiful Arrangement 06:55
-
527. Word Abbreviation 23:27
-
528. Random Pick with Weight 05:27
-
529. Minesweeper 13:53
-
530. Minimum Absolute Difference in BST 03:43
-
531. Lonely Pixel I 05:56
-
532. K-diff Pairs in an Array 04:13
-
533. Lonely Pixel II 12:16
-
535. Encode and Decode TinyURL 06:50
-
536. Construct Binary Tree from String 09:56
-
537. Complex Number Multiplication 03:19
-
538. Convert BST to Greater Tree 03:51
-
539. Minimum Time Difference 15:45
-
540. Single Element in a Sorted Array 06:18
-
541. Reverse String II 04:59
-
542. 01 Matrix 15:14
-
543. Diameter of Binary Tree 04:40
-
544. Output Contest Matches 07:41
-
545. Boundary of Binary Tree 10:47
-
546. Remove Boxes 19:59
-
547. Friend Circles 07:54
-
548. Split Array with Equal Sum 15:42
-
549. Binary Tree Longest Consecutive Sequence II 14:01
-
-
第七章 Leetcode 551 - 600展开
-
551. Student Attendance Record I 03:11
-
552. Student Attendance Record II 12:05
-
553. Optimal Division 06:25
-
554. Brick Wall 05:12
-
555. Split Concatenated Strings 14:04
-
556. Next Greater Element III 09:23
-
557. Reverse Words in a String III 07:11
-
558. Quad Tree Intersection 08:44
-
559. Maximum Depth of N-ary Tree 03:20
-
560. Subarray Sum Equals K 11:30
-
561. Array Partition I 11:07
-
562. Longest Line of Consecutive One in Matrix 14:01
-
563. Binary Tree Tilt 06:00
-
564. Find the Closest Palindrome 12:10
-
565. Array Nesting 05:17
-
566. Reshape the Matrix 06:03
-
567. Permutation in String 04:33
-
568. Maximum Vacation Days 29:26
-
572. Subtree of Another Tree 03:46
-
573. Squirrel Simulation 06:13
-
575. Distribute Candies 04:36
-
576. Out of Boundary Paths 12:16
-
581. Shortest Unsorted Continuous Subarray 11:46
-
582. Kill Process 08:40
-
583. Delete Operation for Two Strings 12:14
-
587. Erect the Fence 13:30
-
588. Design In-Memory File System 19:58
-
589. N-ary Tree Preorder Traversal 02:47
-
590. N-ary Tree Postorder Traversal 03:38
-
591. Tag Validator 15:40
-
592. Fraction Addition and Subtraction 08:21
-
593. Valid Square 05:05
-
594. Longest Harmonious Subsequence 05:37
-
598. Range Addition II 06:10
-
599. Minimum Index Sum of Two Lists 07:12
-
600. Non-negative Integers without Consecutive Ones 30:03
-
课程 目录
LeetCode 题目视频讲解（601-900七月完成）
课程总时长: 预计30小时
展开
-
第一章 课程介绍收起
-
1-1 课程介绍 04:38
-
-
第二章：Leetcode 601 - 650收起
-
604. Design Compressed String Iterator 14:56
-
605. Can Place Flowers 06:27
-
606. Construct String from Binary Tree 05:39
-
609. Find Duplicate File in System 13:54
-
611. Valid Triangle Number 06:24
-
616. Add Bold Tag in String 15:32
-
617. Merge Two Binary Trees 02:48
-
621. Task Scheduler 25:02
-
622. Design Circular Queue 11:54
-
623. Add One Row to Tree 16:09
-
624. Maximum Distance in Arrays 04:36
-
625. Minimum Factorization 13:12
-
628. Maximum Product of Three Numbers 10:21
-
629. K Inverse Pairs Array 13:33
-
630. Course Schedule III 08:47
-
631. Design Excel Sum Formula 20:35
-
632. Smallest Range Covering Elements from K Lists 27:05
-
633. Sum of Square Numbers 06:05
-
634. Find the Derangement of An Array 10:26
-
635. Design Log Storage System 16:57
-
636. Exclusive Time of Functions 08:14
-
637. Average of Levels in Binary Tree 02:49
-
638. Shopping Offers 21:40
-
639. Decode Ways II 17:17
-
640. Solve the Equation 16:54
-
641. Design Circular Deque 14:20
-
642. Design Search Autocomplete System 31:09
-
643. Maximum Average Subarray I 03:15
-
644. Maximum Average Subarray II 21:05
-
645. Set Mismatch 14:11
-
646. Maximum Length of Pair Chain 04:13
-
647. Palindromic Substrings 05:07
-
648. Replace Words 10:52
-
649. Dota2 Senate 10:26
-
650. 2 Keys Keyboard 11:32
-
-
第三章：Leetcode 651 - 700展开
-
651. 4 Keys Keyboard 08:15
-
652. Find Duplicate Subtrees 10:28
-
653. Two Sum IV - Input is a BST 09:53
-
654. Maximum Binary Tree 10:44
-
655. Print Binary Tree 07:04
-
656. Coin Path 17:33
-
657. Robot Return to Origin 02:36
-
658. Find K Closest Elements 09:03
-
659. Split Array into Consecutive Subsequences 14:32
-
660. Remove 9 03:18
-
661. Image Smoother 03:56
-
662. Maximum Width of Binary Tree 07:57
-
663. Equal Tree Partition 07:38
-
664. Strange Printer 14:00
-
665. Non-decreasing Array 07:53
-
666. Path Sum IV 10:59
-
667. Beautiful Arrangement II 04:59
-
668. Kth Smallest Number in Multiplication Table 06:47
-
669. Trim a Binary Search Tree 06:53
-
670. Maximum Swap 06:34
-
671. Second Minimum Node In a Binary Tree 08:32
-
672. Bulb Switcher II 07:30
-
673. Number of Longest Increasing Subsequence 16:52
-
674. Longest Continuous Increasing Subsequence 03:46
-
675. Cut Off Trees for Golf Event 16:54
-
676. Implement Magic Dictionary 07:34
-
677. Map Sum Pairs 08:12
-
678. Valid Parenthesis String 11:13
-
679. 24 Game 12:20
-
680. Valid Palindrome II 03:43
-
681. Next Closest Time 12:28
-
682. Baseball Game 08:08
-
683. K Empty Slots 13:39
-
684. Redundant Connection 05:55
-
685. Redundant Connection II 12:28
-
686. Repeated String Match 03:57
-
687. Longest Univalue Path 09:18
-
688. Knight Probability in Chessboard 12:59
-
689. Maximum Sum of 3 Non-Overlapping Subarrays 18:03
-
690. Employee Importance 05:50
-
691. Stickers to Spell Word 23:31
-
692. Top K Frequent Words 11:38
-
693. Binary Number with Alternating Bits 02:37
-
694. Number of Distinct Islands 05:13
-
695. Max Area of Island 03:14
-
696. Count Binary Substrings 11:17
-
697. Degree of an Array 11:40
-
698. Partition to K Equal Sum Subsets 09:21
-
699. Falling Squares 24:33
-
700. Search in a Binary Search Tree 04:43
-
-
第七章：Leetcode 851 - 900展开
-
851. Loud and Rich 10:26
-
852. Peak Index in a Mountain Array 03:08
-
853. Car Fleet 08:45
-
854. K-Similar Strings 15:09
-
855. Exam Room 12:05
-
856. Score of Parentheses 10:14
-
857. Minimum Cost to Hire K Workers 11:56
-
858. Mirror Reflection 07:17
-
859. Buddy Strings 09:00
-
860. Lemonade Change 06:55
-
861. Score After Flipping Matrix 07:07
-
862. Shortest Subarray with Sum at Least K 08:57
-
863. All Nodes Distance K in Binary Tree 20:01
-
864. Shortest Path to Get All Keys 14:03
-
865. Smallest Subtree with all the Deepest Nodes 09:40
-
866. Prime Palindrome 03:18
-
867. Transpose Matrix 01:06
-
868. Binary Gap 04:58
-
869. Reordered Power of 2 06:07
-
870. Advantage Shuffle 10:09
-
871. Minimum Number of Refueling Stops 08:46
-
872. Leaf-Similar Trees 03:22
-
873. Length of Longest Fibonacci Subsequence 09:40
-
874. Walking Robot Simulation 14:47
-
875. Koko Eating Bananas 08:54
-
876. Middle of the Linked List 02:20
-
877. Stone Game 07:06
-
878. Nth Magical Number 06:10
-
879. Profitable Schemes 14:16
-
880. Decoded String at Index 16:09
-
881. Boats to Save People 04:31
-
882. Reachable Nodes In Subdivided Graph 14:55
-
883. Projection Area of 3D Shapes 06:23
-
884. Uncommon Words from Two Sentences 04:45
-
885. Spiral Matrix III 13:18
-
886. Possible Bipartition 13:48
-
887. Super Egg Drop 13:51
-
888. Fair Candy Swap 07:22
-
889. Construct Binary Tree from Preorder and Postorder Traversal 03:11
-
890. Find and Replace Pattern 10:49
-
891. Sum of Subsequence Widths 06:13
-
892. Surface Area of 3D Shapes 05:34
-
893. Groups of Special-Equivalent Strings 06:30
-
894. All Possible Full Binary Trees 08:22
-
895. Maximum Frequency Stack 10:54
-
896. Monotonic Array 03:11
-
897. Increasing Order Search Tree 03:59
-
898. Bitwise ORs of Subarrays 08:14
-
899. Orderly Queue 06:20
-
900. RLE Iterator 06:21
-
课程 目录
OOD面向对象设计
敬请期待
展开
课程 目录
System Design 系统设计
敬请期待
展开
