Leetcode
Leetcode
Tag I -- -- Two Pointer
27. Remove Element
26. Remove Duplicates in Sorted array
283. Move Zeroes – Two pointer / Array
349. Intersection of Two Arrays – Two Pointer
350. Intersection of Two Arrays II -- -- Hash Table / Two Pointer
344. Reverse String -- -- Two Pointer / String
28. Implement strStr() -- -- Two Pointer / String
125. Valid Palindrome -- -- Two Pointer / String
234. Palindrome Linked List. -- -- Two Pointer / Linked List
88. Merge Sorted Array -- -- Two Pointer / Array
141. Linked List Cycle – -- Linked List / Two Pointers
142. Linked List Cycle II -- -- Linked List / Two Pointers 经典题目
345. Reverse Vowels of a String -- -- String / Two Pointers
19. Remove Nth Node from End of List --- Two Pointers / Linked List 经典
Tag II -- -- Linked List
各种关系data structure很重要
237. Delete Node in a Linked List -- -- Linked List
203. Remove Linked List Elements
83. Remove Duplicates from Sorted List
82. Remove Duplicates from Sorted List II -- 【M】必背dummy node
206. Reverse Linked List 经典
92. Reverse Linked List II -- 【M】经典
21. Merge Two Sorted Lists -- dummy node
86. Partition List --【M】
160. Intersection of Two Linked List
24. Swap Nodes in Pairs
Tag III -- -- Sort
242. Valid Anagram -- -- Counting Sort / Hash Table 经典但是没懂。
75. 【M】Sort Colors -- -- Counting Sort / Two Pointers / Array 一周之内最好每天做一遍，三指针太牛了
148. 【M】Sort List 经典重要 快排 不懂
Tag IV. Tree
101. Symmetric Tree -- DFS / BFS / Tree
100. Same Tree – Tree / DFS
226. Invert Binary Tree – Tree
257. Binary Tree Path – Tree / DFS
104. Maximum of Depth of Binary Tree – Tree / DFS Depth-First Search
递进一个题：Lintcode 改变 root leave
递进 Lintcode: Binary Tree Maximum Path Sum II root any node/D&C
递进 124. Binary Tree Maximum Path Sum 【H】any node any node / D&C经典
111. Minimum of Binary Tree – Tree / DFS / BFS
110. Balanced Binary Tree – Tree / DFS / D&C
102. Binary Tree Level Order Traversal – Tree / BFS必背
107. Binary Tree Level Order Traversal II
103. Binary Tree Zigzag Level Order Traversal – 【M】
235. Lowest Common Ancestor of a Binary Search Tree
236. Lowest Common Ancestor of a Binary Tree 【M】多体会
404. Sum of Left Leaves -- Tree
112. Path Sum – 数的求和
113. Path Sum II -- 【M】DFS
144. Binary Tree Preorder Traversal – Stack / Tree/ 【M】
94. Binary Tree Inorder Traversal – Tree/ Stack 【M】经典 必背
145. Binary Tree Postorder Traversal -- 【H】
270. Closest Binary Search Tree Value 【E】
298. Binary Tree Longest Consecutive Sequence -- 【M】
Tag V ---- Binary Search BS-Index/BS-Result
Lintcode. First position of Target -- BS-Index
Lintcode. Last position of Target -- BS-Index
74. Search a 2D Matrix – BS-Index / Array
35. Search Insert Position – BS-Index / Array
Lintcode. Search in a Big Sorted Array – BS-Idex / O(log k)
153. Find Minimum in Rotated Sorted Array -- 【M】Good / BS-Index
33. Search in Rotated Sorted Array -- 【H】/ BS-Index
69. Sqrt(x) -- 【M】/ BS-Result
278. First Bad Version – BS/Result
Lintcode. Wood Cut – BS/Result 【M】经典
162. Find Peak Element – BS/Result / Array 【M】
34. Search for a Range -- 【M】
98. Validate Binary Search Tree – inorder延伸【M】
173. Binary Search Tree Iterator --【M】常见/ inorder/stack
285. Inorder Successor in Binary Search Tree -- 【M】
Lintcode 没做的
Tag VI. Array
78. Subsets – Array / Backtracking / Bit Manipulation 【M】必背非递归
56. Merge Intervals – 【H】/ Array/ Sort
200. Number of Islands -- 【M】DFS+BFS+Recursive
228. Summary Ranges --【M】
163. Missing Ranges --【M】
Tag VII. Dynamic Programming
120. Triangle --【M】有问题 动规求最小值
64. Minimum Path Sum -- 【M】动规求最小值
62. Unique Paths -- 【M】动规统计方案个数
63. Unique Paths II -- 【M】动规统计方案个数
70. Climbing Stairs
Lintcode -- Jump Game / Greedy/ DP -【M】
Lintcode -- Jump Game II / Greedy/ DP -【M】
300. Longest Increasing Subsequence --【M】经典 LIS问题
121. Best Time to Buy and Sell Stock
279. Perfect Squares --【M】/DP/ BFS 答案也没有看懂
139. Word Break--【M】/DP 不明白
Tag VIII. Hash Table
288. Unique Word Abbreviation
Tag VIIII. Stack
20. Valid Parentheses
155. Min Stack -- /design
Tag X. BackTracking
Tag XI. String
Powered by
GitBook
Tag VIIII. Stack
Tag VIIII. Stack
results matching "
"
No results matching "
"