首页
刷题班
LeetCode面试刷题班
短期算法速成班
旗舰班
课程对比
北美留学SDE求职班
北美在职SDE跳槽班
LC分类顺序表
创始人故事
登录
/
注册
LeetCode面试刷题班
全网独家LeetCode题目视频讲解课程，实战题型技巧总结
900
题
LC视频讲解
1000+
章节内容
100+
课时
录播模式
18
类
题型总结
90
天
答疑服务
课程介绍
课题目录
试看
用户评论
优惠价格
常见问题
题型技巧总结（上）
题型技巧总结（下）
LC视频讲解（1-300）
LC视频讲解（301-600）
LC视频讲解（601-900）
课程 目录
题型技巧总结（上）
课程总时长: 17小时
试听
展开
第一章 课程介绍
收起
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
课程 目录
LeetCode 题目视频讲解（1-300）
课程总时长: 43小时
试听
展开
第一章 课程介绍
收起
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 701 - 750
展开
701. Insert into a Binary Search Tree
02:54
702. Search in a Sorted Array of Unknown Size
04:15
703. Kth Largest Element in a Stream
05:13
704. Binary Search
02:30
705. Design HashSet
07:39
706. Design HashMap
12:32
707. Design Linked List
11:50
708. Insert into a Sorted Circular Linked List
06:17
709. To Lower Case
02:05
710. Random Pick with Blacklist
18:31
711. Number of Distinct Islands II
18:08
712. Minimum ASCII Delete Sum for Two Strings
06:06
713. Subarray Product Less Than K
05:43
714. Best Time to Buy and Sell Stock with Transaction Fee
04:47
715. Range Module
14:01
716. Max Stack
23:29
717. 1-bit and 2-bit Characters
07:15
718. Maximum Length of Repeated Subarray
16:55
719. Find K-th Smallest Pair Distance
11:16
720. Longest Word in Dictionary
17:10
721. Accounts Merge
17:25
722. Remove Comments
08:19
723. Candy Crush
13:00
724. Find Pivot Index
03:33
725. Split Linked List in Parts
08:19
726. Number of Atoms
15:29
727. Minimum Window Subsequence
18:13
728. Self Dividing Numbers
06:38
729. My Calendar I
08:29
730. Count Different Palindromic Subsequences
15:46
731. My Calendar II
11:23
732. My Calendar III
05:08
733. Flood Fill
04:59
734. Sentence Similarity
08:33
735. Asteroid Collision
08:00
736. Parse Lisp Expression
22:01
737. Sentence Similarity II
09:57
738. Monotone Increasing Digits
10:09
739. Daily Temperatures
08:24
740. Delete and Earn
12:34
741. Cherry Pickup
21:21
742. Closest Leaf in a Binary Tree
11:59
743. Network Delay Time
12:53
744. Find Smallest Letter Greater Than Target
04:51
745. Prefix and Suffix Search
16:11
746. Min Cost Climbing Stairs
03:38
747. Largest Number At Least Twice of Others
04:12
748. Shortest Completing Word
10:41
749. Contain Virus
24:56
750. Number Of Corner Rectangles
09:03
第五章：Leetcode 751 - 800
展开
751. IP to CIDR
14:17
752. Open the Lock
13:40
753. Cracking the Safe
10:32
754. Reach a Number
08:04
755. Pour Water
08:03
756. Pyramid Transition Matrix
12:44
757. Set Intersection Size At Least Two
12:08
758. Bold Words in String
15:21
759. Employee Free Time
09:56
760. Find Anagram Mappings
05:09
761. Special Binary String
06:48
762. Prime Number of Set Bits in Binary Representation
03:22
763. Partition Labels
06:29
764. Largest Plus Sign
09:15
765. Couples Holding Hands
14:23
766. Toeplitz Matrix
02:50
767. Reorganize String
20:03
768. Max Chunks To Make Sorted II
16:03
769. Max Chunks To Make Sorted
05:06
770. Basic Calculator IV
21:38
771. Jewels and Stones
05:21
772. Basic Calculator III
22:37
773. Sliding Puzzle
16:23
774. Minimize Max Distance to Gas Station
09:45
775. Global and Local Inversions
04:19
776. Split BST
08:18
777. Swap Adjacent in LR String
11:07
778. Swim in Rising Water
18:29
779. K-th Symbol in Grammar
03:12
780. Reaching Points
06:07
781. Rabbits in Forest
07:27
782. Transform to Chessboard
10:05
783. Minimum Distance Between BST Nodes
03:50
784. Letter Case Permutation
13:14
785. Is Graph Bipartite?
12:17
786. K-th Smallest Prime Fraction
15:00
787. Cheapest Flights Within K Stops
24:26
788. Rotated Digits
11:55
789. Escape The Ghosts
05:40
790. Domino and Tromino Tiling
07:10
791. Custom Sort String
07:26
792. Number of Matching Subsequences
08:52
793. Preimage Size of Factorial Zeroes Function
09:31
794. Valid Tic-Tac-Toe State
04:42
795. Number of Subarrays with Bounded Maximum
03:54
796. Rotate String
02:02
797. All Paths From Source to Target
03:34
798. Smallest Rotation with Highest Score
10:29
799. Champagne Tower
11:18
800. Similar RGB Color
05:19
第六章：Leetcode 801 - 850
展开
801. Minimum Swaps To Make Sequences Increasing
14:03
802. Find Eventual Safe States
16:47
803. Bricks Falling When Hit
19:52
804. Unique Morse Code Words
05:27
805. Split Array With Same Average
11:39
806. Number of Lines To Write String
06:36
807. Max Increase to Keep City Skyline
05:28
808. Soup Servings
06:10
809. Expressive Words
09:27
810. Chalkboard XOR Game
03:44
811. Subdomain Visit Count
12:25
812. Largest Triangle Area
03:40
813. Largest Sum of Averages
19:55
814. Binary Tree Pruning
02:13
815. Bus Routes
08:04
816. Ambiguous Coordinates
13:10
817. Linked List Components
03:54
818. Race Car
18:11
819. Most Common Word
17:32
820. Short Encoding of Words
12:44
821. Shortest Distance to a Character
08:26
822. Card Flipping Game
05:27
823. Binary Trees With Factors
09:48
824. Goat Latin
19:29
825. Friends Of Appropriate Ages
07:50
826. Most Profit Assigning Work
10:23
827. Making A Large Island
08:42
828. Count Unique Characters of All Substrings of a Given String
12:51
829. Consecutive Numbers Sum
02:58
830. Positions of Large Groups
04:54
831. Masking Personal Information
06:56
832. Flipping an Image
04:56
833. Find And Replace in String
08:21
834. Sum of Distances in Tre
13:14
835. Image Overlap
11:06
836. Rectangle Overlap
03:22
837. New 21 Game
10:02
838. Push Dominoes
13:40
839. Similar String Groups
09:49
840. Magic Squares In Grid
08:45
841. Keys and Rooms
05:27
842. Split Array into Fibonacci Sequence
12:16
843. Guess the Word
12:58
844. Backspace String Compare
11:59
845. Longest Mountain in Array
05:08
846. Hand of Straights
15:43
847. Shortest Path Visiting All Nodes
14:29
848. Shifting Letters
04:31
849. Maximize Distance to Closest Person
24:02
850. Rectangle Area II
07:40
第七章：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
课程介绍：
LeetCode面试刷题班
扫描微信二维码
课程和网站疑问
针对课程有疑问？
购买时遇到问题？
