题号 | 标题 | 难度 | 代码 | 提示 |
---|---|---|---|---|
136 | Single Number | Medium | 解1 解2 | |
137 | Single Number II | Medium | 解1 | |
190 | Reverse Bits | Easy | 解1 解2 | |
191 | Number of 1 Bits | Easy | 解1 解2 | |
201 | Bitwise AND of Numbers Range | Medium | 解1 | |
231 | Power of Two | Easy | 解1 | |
260 | Single Number III | Medium | 解1 解2 | |
268 | Missing Number | Medium | 解1 解2 | |
318 | Maximum Product of Word Lengths | Medium | 解1 解2 | |
342 | Power of Four | Easy | 解1 | |
371 | Sum of Two Integers | Easy | 解1 |
题号 | 标题 | 难度 | 代码 | 提示 |
---|---|---|---|---|
15 | 3 Sum | Medium | 解1 | |
16 | 3 Sum Closest | Medium | 解1 解2 | |
18 | 4 Sum | Medium | 解1 解2 | |
26 | Remove Duplicates from Sorted Array | Easy | 解1 解2 | |
27 | Remove Element | Easy | 解1 | |
31 | Next Permutation | Medium | 解1 | |
48 | Rotate Image | Medium | 解1 | |
54 | Spiral Matrix | Medium | 解1 | |
59 | Spiral Matrix II | Medium | 解1 | |
66 | Plus One | Easy | 解1 | |
73 | Set Matrix Zeroes | Medium | 解1 | |
80 | Remove Duplicates from Sorted Array II | Medium | 解1 | |
118 | Pascal's Triangle | Easy | 解1 | |
119 | Pascal's Triangle II | Easy | 解1 | |
121 | Best Time to Buy and Sell Stock | Medium | 解1 | |
169 | Majority Element | Easy | 解1 | |
189 | Rotate Array | Easy | 解1 | |
209 | Minimum Size Subarray Sum | Medium | 解1 | |
215 | Kth Largest Element in an Array | Medium | 解1 解2 | |
228 | Summary Ranges | Easy | 解1 | |
229 | Majority Element II | Medium | 解1 | |
238 | Product of Array Except Self | Medium | 解1 解2 | |
240 | Search a 2D Matrix II | Medium | 解1 解2 | |
334 | Increasing Triplet Subsequence | Medium | 解1 解2 解3 |
题号 | 标题 | 难度 | 代码 | 提示 |
---|---|---|---|---|
6 | ZigZag Conversion | Easy | 解1 解2 | |
8 | String to Integer (atoi) | Easy | 解1 | |
14 | Longest Common Prefix | Easy | 解1 | |
28 | Implement strStr() | Easy | 解1 解2 | |
38 | Count and Say | Easy | 解1 | |
43 | Multiply Strings | Medium | 解1 解2 | |
58 | Length of Last Word | Easy | 解1 | |
67 | Add Binary | Easy | 解1 | |
125 | Valid Palindrome | Easy | 解1 | |
151 | Reverse Words in a String | Medium | 解1 | |
165 | Compare Version Numbers | Easy | 解1 | |
242 | Valid Anagram | Easy | 解1 | |
273 | Integer to English Words | Medium | 解1 | |
306 | Addictive Number | Medium | 解1 | |
383 | Ransom Note | Easy | 解1 |
题号 | 标题 | 难度 | 代码 | 提示 |
---|---|---|---|---|
2 | Add Two Numbers | Medium | 解1 | |
21 | Merge Two Sorted Lists | Easy | 解1 | |
24 | Swap Nodes in Pairs | Medium | 解1 | |
61 | Rotate List | Medium | 解1 | |
82 | Remove Duplicates from Sorted List II | Medium | 解1 | |
83 | Remove Duplicates from Sorted List | Easy | 解1 | |
92 | Reverse Linked List II | Medium | 解1 | |
146 | LRU Cache | Hard | 解1 | |
160 | Intersection of Two Linked Lists | Easy | 解1 | |
203 | Remove Linked List Elements | Easy | 解1 | |
206 | Reverse Linked List | Easy | 解1 | |
234 | Palindrome Linked List | Easy | 解1 | |
237 | Delete Node in a Linked List | Easy | 解1 | |
328 | Odd Even Linked List | Easy | 解1 |
题号 | 标题 | 难度 | 代码 | 提示 |
---|---|---|---|---|
20 | Valid Parentheses | Easy | 解1 | |
71 | Simplify Path | Medium | 解1 | |
101 | Symmetric Tree | Easy | 解1 | |
150 | Evaluate Reverse Polish Notation | Medium | 解1 | |
155 | Min Stack | Easy | 解1 解2 | |
173 | Binary Search Tree Iterator | Medium | 解1 | |
224 | Basic Calculator | Medium | 解1 | |
227 | Basic Calculator II | Medium | 解1 | |
232 | Implement Queue using Stacks | Easy | 解1 | |
331 | Verify Preorder Serialization of a Binary Tree | Medium | 解1 | |
385 | Mini Parser | Medium | 解1 |
题号 | 标题 | 难度 | 代码 | 提示 |
---|---|---|---|---|
225 | Implement Stack using Queues | Medium | 解1 |
题号 | 标题 | 难度 | 代码 | 提示 |
---|---|---|---|---|
264 | Ugly Number II | Medium | 解1 | |
313 | Super Ugly Number | Medium | 解1 | |
373 | Find K Pairs with Smallest Sums | Medium | 解1 | |
378 | Kth Smallest Element in a Sorted Matrix | Medium | 解1 |
题号 | 标题 | 难度 | 代码 | 提示 |
---|---|---|---|---|
94 | Binary Tree Inorder Traversal | Medium | 解1 解2 | |
144 | Binary Tree Preorder Traversal | Medium | 解1 解1 | |
208 | Implement Trie (Prefix Tree) | Medium | 解1 | |
211 | Add and Search Word - Data structure design | Medium | 解1 | |
226 | Invert Binary Tree | Easy | 解1 | |
297 | Serialize and Deserialize Binary Tree | Medium | 解1 | |
307 | Range Sum Query - Mutable | Medium | 解1 |
题号 | 标题 | 难度 | 代码 | 提示 |
---|---|---|---|---|
1 | Two Sum | Medium | 解1 解2 | |
3 | Longest Substring Without Repeating Characters | Medium | 解1 | |
36 | Valid Sudoku | Easy | 解1 | |
49 | Group Anagrams | Medium | 解1 | |
187 | Repeated DNA Sequences | Medium | 解1 | |
202 | Happy Number | Easy | 解1 | |
204 | Count Primes | Easy | 解1 | |
205 | Isomorphic Strings | Easy | 解1 | |
217 | [Contains Duplicate](Contains Duplicate) | Easy | 解1 | |
219 | Contains Duplicate II | Easy | 解1 | |
290 | Word Pattern | Easy | 解1 | |
299 | Bulls and Cow | Easy | 解1 |
题号 | 标题 | 难度 | 代码 | 提示 |
---|---|---|---|---|
75 | Sort Colors | Medium | 解1 | |
88 | Merge Sorted Array | Easy | 解1 | |
147 | Insertion Sort List | Medium | 解1 | |
148 | Sort List | Medium | 解1 | |
179 | Largest Number | Medium | 解1 | |
274 | H-Index | Medium | 解1 | |
324 | Wiggle Sort II | Medium | 解1 | |
347 | Top K Frequent Elements | Medium | 解1 |
题号 | 标题 | 难度 | 代码 | 提示 |
---|---|---|---|---|
95 | Unique Binary Search Trees II | Medium | 解1 | |
98 | Validate Binary Search Tree | Medium | 解1 | |
100 | Same Tree | Easy | 解1 | |
104 | Maximum Depth of Binary Tree | Easy | 解1 | |
105 | Construct Binary Tree from Preorder and Inorder Traversal | Medium | 解1 | |
106 | Construct Binary Tree from Inorder and Postorder Traversal | Medium | 解1 | |
108 | Convert Sorted Array to Binary Search Tree | Medium | 解1 | |
109 | Convert Sorted List to Binary Search Tree | Medium | 解1 | |
110 | Balanced Binary Tree | Easy | 解1 | |
111 | Minimum Depth of Binary Tree | Easy | 解1 | |
114 | Flatten Binary Tree to Linked List | Medium | 解1 | |
116 | Populating Next Right Pointers in Each Node | Medium | 解1 | |
129 | Sum Root to Leaf Numbers | Medium | 解1 | |
241 | Different Ways to Add Parentheses | Medium | 解1 | |
337 | House Robber III | Medium | 解1 |
题号 | 标题 | 难度 | 代码 | 提示 |
---|---|---|---|---|
19 | Remove Nth Node From End of List | Easy | 解1 | |
86 | Partition List | Medium | 解1 | |
141 | Linked List Cycle | Medium | 解1 | |
142 | Linked List Cycle II | Medium | 解1 | |
143 | Reorder List | Medium | 解1 | |
283 | Move Zeroes | Easy | 解1 解2 | |
344 | Reverse String | Easy | 解1 | |
345 | Reverse Vowels of a String | Easy | 解1 | |
349 | Intersection of Two Arrays | Easy | 解1 解1 | |
350 | Intersection of Two Arrays II | Easy | 解1 |
题号 | 标题 | 难度 | 代码 | 提示 |
---|---|---|---|---|
33 | Search in Rotated Sorted Array | Hard | 解1 | |
34 | Search for a Range | Medium | 解1 | |
35 | Search Insert Position | Medium | 解1 | |
69 | Sqrt(x) | Medium | 解1 | |
74 | Search a 2D Matrix | Medium | 解1 | |
81 | Search in Rotated Sorted Array II | Medium | 解1 | |
153 | Find Minimum in Rotated Sorted Array | Medium | 解1 | |
162 | Find Peak Element | Medium | 解1 | |
222 | Count Complete Tree Nodes | Medium | 解1 | |
275 | H-Index II | Medium | 解1 | |
278 | First Bad Version | Easy | 解1 | |
300 | Longest Increasing Subsequence | Medium | 解1 | |
367 | Valid Perfect Square | Medium | 解1 | |
374 | Guess Number Higher or Lower | Easy | 解1 |
题号 | 标题 | 难度 | 代码 | 提示 |
---|---|---|---|---|
220 | Contains Duplicate III | Medium | 解1 | |
230 | Kth Smallest Element in a BST | Medium | 解1 解2 | |
235 | Lowest Common Ancestor of a Binary Search Tree | Easy | 解1 |
题号 | 标题 | 难度 | 代码 | 提示 |
---|---|---|---|---|
53 | Maximum Subarray | Medium | 解1 | |
62 | Unique Paths | Medium | 解1 | |
63 | Unique Paths II | Medium | 解1 | |
64 | Minimum Path Sum | Medium | 解1 | |
70 | Climbing Stairs | Easy | 解1 | |
91 | Decode Ways | Medium | 解1 | |
96 | Unique Binary Search Trees | Medium | 解1 | |
120 | Triangle | Medium | 解1 | |
139 | Word Break | Medium | 解1 | |
152 | Maximum Product Subarray | Medium | 解1 | |
198 | House Robber | Easy | 解1 | |
213 | House Robber II | Medium | 解1 | |
221 | Maximal Square | Medium | 解1 | |
279 | Perfect Squares | Medium | 解1 | |
303 | Range Sum Query - Immutable | Easy | 解1 解1 | |
304 | Range Sum Query 2D - Immutable | Medium | 解1 | |
309 | Best Time to Buy and Sell Stock with Cooldown | Medium | 解1 | |
322 | Coin Change | Medium | 解1 | |
357 | Count Numbers with Unique Digits | Medium | 解1 | |
368 | Largest Divisible Subset | Medium | 解1 | |
375 | Guess Number Higher or Lower II | Medium | 解1 | |
377 | Combination Sum IV | Medium | 解1 |
题号 | 标题 | 难度 | 代码 | 提示 |
---|---|---|---|---|
11 | Container With Most Water | Medium | 解1 | |
55 | Jump Game | Medium | 解1 | |
122 | Best Time to Buy and Sell Stock II | Medium | 解1 | |
134 | Gas Station | Medium | 解1 | |
316 | Remove Duplicate Letters | Medium | 解1 | |
376 | Wiggle Subsequence | Medium | 解1 解2 | |
392 | Is Subsequence | Medium | 解1 | |
397 | Integer Replacement | Easy | 解1 解2 | |
402 | Remove K Digits | Medium | 解1 |
题号 | 标题 | 难度 | 代码 | 提示 |
---|---|---|---|---|
102 | Binary Tree Level Order Traversal | Easy | 解1 | |
107 | Binary Tree Level Order Traversal II | Easy | 解1 | |
103 | Binary Tree Zigzag Level Order Traversal | Medium | 解1 | |
127 | Word Ladder | Medium | 解1 | |
130 | Surrounded Regions | Medium | 解1 | |
207 | Course Schedule | Medium | 解1 | |
210 | Course Schedule II | Medium | 解1 | |
112 | Path Sum | Easy | 解1 | |
113 | Path Sum II | Medium | 解1 | |
199 | Binary Tree Right Side View | Medium | 解1 | |
200 | Number of Islands | Medium | 解1 | |
236 | Lowest Common Ancestor of a Binary Tree | Medium | 解1 | |
257 | Binary Tree Paths | Medium | 解1 | |
332 | Reconstruct Itinerary | Medium | 解1 | |
399 | Evaluate Division | Medium | 解1 |
Thanks kamyu104