[leetcode]做过的题的目录

随着做过的题越来越多,我觉得我需要一个目录来让我飞快的找到题目。

题目名称难易程度可考虑的解法
133. Clone GraphMedium bfs, map to store new node and old node 
973. K Closest Points to OriginMedium priority_queue, min heap 
238. Product of Array Except SelfMedium multiply numbers from one side to another side 
953. Verifying an Alien DictionaryEasyHashMap store the index(which is order)
9. Palindrome NumberEasyUsing properties of panlidrome
3. Longest Substring Without Repeating CharactersMediumSliding window, array enumation
399. Evaluate DivisionMediumdirected graph
712. Minimum ASCII Delete Sum for Two StringsMediumDP
845. Longest Mountain in ArrayMedium Discuss in case
815. Bus RoutesHardBFS
204. Count Primes Easycheck every number read detals 
190. Reverse BitsEasy Bit operation 
154. Find Minimum in Rotated Sorted Array II Hard Binary Search 
165. Compare Version Numbers Medium compare every sigle number 
187. Repeated DNA SequencesMedium using map 
698. Partition to K Equal Sum Subsets Medium DFS / DP 
445. Add Two Numbers II Medium Using Stack 
582. Kill ProcessMedium using queue to help 
74. Search a 2D Matrix Medium Binary Search
129. Sum Root to Leaf NumbersMedium Recursion 
199. Binary Tree Right Side ViewMedium Layer traverse  
831. Masking Personal Information Medium Check every situations 
516. Longest Palindromic Subsequence Medium Dynamic Programming
251. Flatten 2D Vector Medium using iterators
140. Word Break II hard memorized searching 
296. Best Meeting Point hard Hamilton distance read details
450. Delete Node in a BST Medium recursion read details 
290. Word Pattern Easy Using hashmap
266. Palindrome Permutation Easy counting the appearance times of characteristics
186. Reverse Words in a String II Medium using stack
648. Replace WordsMedium HashMap 
203. Remove Linked List ElementsEasycheck every nodes and recorde previous node
442. Find All Duplicates in an ArrayMedium read details(assign each number to its position 
807. Max Increase to Keep City Skyline Medium find column maximum and row maximum 
433. Minimum Genetic Mutation Medium using bfs to test every possible mutation 
205. Isomorphic Strings Easy using hash-map to store last position
457. Circular Array Loop Medium using fast and slow pointers
735. Asteroid CollisionMedium using vector to store the alive asteroid
722. Remove CommentsMedium check every character one by one 
298. Binary Tree Longest Consecutive Sequence Medium recursion
117. Populating Next Right Pointers in Each Node II Medium nested loop with pointers (read details)
116. Populating Next Right Pointers in Each NodeMedium layer traverse by queue
163. Missing Ranges Medium traverse the array 
727. Minimum Window Subsequence Hard DP 
336. Palindrome PairsHard Hash Map
642. Design Search Autocomplete System Hard Trie tree with priority queue
65. Valid NumberHardDFA
139. Word BreakMediumDP 
489. Robot Room Cleaner HardDFS and store relative position to avoid infinite loop
745. Prefix and Suffix Search HardTrie tree 
56. Merge Intervals Mediumsort and merge 
67. Add BinaryEasyString operation 
256. Paint House Easy DP 
265. Paint House II Hard DP 
275. H-Index II Medium Binary search 
410. Split Array Largest Sum Hard Greedy and Binary search 
88. Merge Sorted ArrayEasy fill spaces back to front
801. Minimum Swaps To Make Sequences Increasing
Medium DP 
764. Largest Plus SignMedium traverse the matrix 
865. Smallest Subtree with all the Deepest Nodes Medium post-order traverse by recursion 
426. Convert Binary Search Tree to Sorted Doubly Linked ListMedium In-order traverse by iteration 
334. Increasing Triplet SubsequenceMedium read details  
639. Decode Ways II Hard watch out cornner cases 
784. Letter Case PermutationEasy  change to the same case and then change
68. Text JustificationHard read details  
109. Convert Sorted List to Binary Search Tree MeidumDivide and Conquer 
173. Binary Search Tree Iterator Mediumuse stack to help 
543. Diameter of Binary TreeEasyrecursion; read question carefully!!
20. Valid Parentheses Easyusing stack
269. Alien Dictionary HardTopological sort
554. Brick Wall MediumAnalyze the questions first! used Map
721. Accounts Merge MediumUnion Find
824. Goat LatinEasyUsing stringstream and apply the rule
689. Maximum Sum of 3 Non-Overlapping SubarraysHardDivide it into 3 parts and DP
283. Move Zeroes  Easy 2 pointers 
282. Expression Add Operators HardDFS and consider the priority 
158. Read N Characters Given Read4 II - Call multiple timesHardread Details 
210. Course Schedule II Medium topological sorting
286. Walls and GatesMedium BFS 
750. Number Of Corner RectanglesMedium taverse with pruning 
274. H-Index Medium understanding the questions first! 
636. Exclusive Time of Functions Medium using stack and pointers 
477. Total Hamming Distance Medium finding the rule in the changing 
380. Insert Delete GetRandom O(1) Medium map and array, the point is O(1) 
825. Friends Of Appropriate Ages Medium analysis given inequation
398. Random Pick IndexMedium reservoir sampling
523. Continuous Subarray Sum Medium accumulate sum 
525. Contiguous Array Medium accumulate sum 
332. Reconstruct Itinerary Medium use multiset and DFS 
323. Number of Connected Components in an Undirected GraphMedium build a adjacent list and DFS 
249. Group Shifted Strings Mediumloop with visited
382. Linked List Random Node Meidumreservoir sampling 
stock系列 121 & 122 & 309 & 714 & 123 & 188 Easy&Medium&HardDp
316. Remove Duplicate Letters Hard used map and loop, read detail 
289. Game of LifeMediumtraverse and change the value
164. Maximum Gap Hard Bucket sort 
804. Unique Morse Code Words Easy Using set and vectors 
220. Contains Duplicate III Medium Using sliding windows and maps 
335. Self Crossing HardEnum all possible situations 
233. Number of Digit One Hard Find its patter 
179. Largest NumberMedium Sort by new comparator 
229. Majority Element II Medium Moore voting 
169. Majority Element Easy Moore voting 
540. Single Element in a Sorted Array Medium Binary Search 
419. Battleships in a BoardMedium traverse and judge 
150. Evaluate Reverse Polish Notation Medium stack 
53. Find Minimum in Rotated Sorted ArrayEasy Binary search 
319. Bulb SwitcherMediumobserve the previous results and do math
223. Rectangle AreaMediumdo math
479. Largest Palindrome Product Easy do math
219. Contains Duplicate II Easy map  !!careful!! 
438. Find All Anagrams in a String Easy sliding window 
406. Queue Reconstruction by HeightMediumanalysis the problems 
581. Shortest Unsorted Continuous Subarray Easy read detail:) 
416. Partition Equal D Sum Medium DP
124. Binary Tree Maximum Path SumMedium traverse by recursion 
240. Search a 2D Matrix IIMedim Find the special corner as start 
160. Intersection of Two Linked ListsEasy check from the same length 
6. ZigZag Conversion Medium find relationships or store in arrays 
172. Factorial Trailing Zeroes Easy find number of 5 
152. Maximum Product Subarray Medium using 2(max, min) help array 
149. Max Points on a LineHarduse map and cal gcd 
22. Generate ParenthesesMediumDFS + limits
328. Odd Even Linked ListMedium pointers 
338. Counting BitsMeidum loop with vector
293. Flip Game && 294. Flip Game IIEasy & Mediumback tracking 
292. Nim GameEasyGame Theory 
4. Median of Two Sorted ArraysHardwith 2 pointers 
209. Minimum Size Subarray Sum Mediumsliding window 
322. Coin Change MediumDP 
673. Number of Longest Increasing SubsequenceMediumwith 2 record vector read details :)
287. Find the duplicate NumberMeidum binary search and fast and slow pointer 
377. Combination Sum IVMeidum DP
89. Gray CodeMediumdetails:) 
43. Multiply StringsMedium use array to store product 
143. Reorder ListMedium break the list into 2 lists, process them
57. Insert IntervalHarddetails :)
76. Minimum Window SubstringHardSliding Window
285. Inorder Successor in BSTMediumcharacteristic of BST, or In-order traverse
161. One Edit Distance Medium Consider corner situations 
311. Sparse Matrix Multiplication Medium pre-process one matrix 
494. Target Sum Medium DFS with memory searching to optimize
670. Maximum SwapMediumfind the maximum of its right including itself 
157. Read N Characters Given Read4Easy read detail:)
680. Valid Palindrome IIEasyoptimal bruce force
314. Binary Tree Vertical Order TraversalMediumLevel order traverse + map
325. Maximum Size Subarray Sum Equals kMediumaccumulate sum + hashmap
253. Meeting Rooms IIMediumheap(priority_queue)
621. Task Scheduler Medium greedy & queue / mathematics
277. Find the CelebrityMediumread details:) 
273. Integer to English Words Harduse map
301. Remove Invalid ParenthesesHard BFS / recursion 
128. Longest Consecutive SequenceHarduse set
236. Lowest Common Ancestor of a Binary TreeMediumPreOrder traverse with stack and pruning
168. Excel Sheet Column TitleEasyloop and reverse() 
127. Word LadderMediumBFS, uses queue and map to help 
560. Subarray Sum Equals KMediumuse map store the times of sum appears
647. Palindromic SubstringsMediumcheck every possible
151. Reverse Words in a StringMediumSTL: reverse()
535. Encode and Decode TinyURLMediumHashMap + rand()
297. Serialize and Deserialize Binary TreeHardiostream
208. Implement Trie (Prefix Tree)MediumTrie tree
146. LRU CacheHardHashmap + list + iterator
632. Smallest RangeHard 
134. Gas StationMediumGreedy
692. Top K Frequent WordsMediumHashMap+pair
347. Top K Frequent ElementsMediumHashMap+pair
106. Construct Binary Tree from Inorder and Postorder TraversalMediumrecursion
105. Construct Binary Tree from Preorder and Inorder TraversalMediumrecursion
81. Search in Rotated Sorted Array IIMediumbinary search
33. Search in rotated sorted arrayMediumbinary search
120. TriangleMedium 
391. Perfect RectangleHardusing the area and 4 points
97. Interleaving StringHarddp
45. Jump Game IIHardgreedy
148. Sort ListMediummerge sort
59. Spiral Matrix IIMedium 
147. Insertion Sort ListMediuminsertion sort
73. Set Matrix ZeroesMedium 
189. Rotate ArrayEasy 
118. Pascal's Triangle && 119. Pascal's Triangle IIEasyqueue
90. Subsets IIMedium 
78. SubsetsMedium 
93. Restore IP AddressesMediumDFS
71. Simplify PathMediumsstream
82. Remove Duplicates from Sorted List IIMediumpointer
26.Remove Duplicates from Sorted ArrayEasypointer
95. Unique Binary Search Trees IIMediumDFS / DP
96. Unique Binary Search TreesMediumDP
312. Burst BalloonsHardDP(区间DP)
99. Recover Binary Search TreeHardInorder traverse
98. Validate Binary Search TreeMediumInorder traverse
30. Substring with Concatenation of All WordsHardDFS + HashMap
29. Divide Two IntegersMediumbit operation
443. String CompressionEasy 
92. Reverse Linked List IIMedium 
114. Flatten Binary Tree to Linked ListMediumstack
814. Binary Tree PruningMedium 
324. Wiggle Sort IIMedium 
341. Flatten Nested List IteratorMediumstack
300. Longest Increasing SubsequenceMedium 
72. Edit DistanceHardDP
63. Unique Paths IIMediumDP
221.Maximal SquareMedium 
House Robbers. 198 & 213Medium & EasyDP
218.The Skyline Problem Hardscan line problem: heap
41. First Missing PositiveHardinteresting method
138. Copy List with Random PointerMediummap / list operation
278. First Bad Version Easybinary search
69. Sqrt(x)Easybinary search
162. Find Peak ElementMediumbinary search
239. Sliding Window MaximumHardheap/deque
654. Maximum Binary TreeMedium 
85. Maximal Rectanglehard 
36. Valid SudokuMediumrecord matrix
32. Longest Valid ParenthesesHardstack
61. Rotated ListMedium 
leetcode栈系列155 & 232 & 349Easystack / 2 stacks
480. Sliding Window MedianHard2 heaps
295. Find Median From Data StreamHard2 heaps
84. Large rectangle in histogramHardmonotonous stack
34. Search for a RangeMedium 
44.wildcard matchingHardDP
48. Rotate ImageMedium 
49. Group AnagramsMediumhashmap
10.Regular Expression MatchingHardrecursion/DP
25. Reverse Node in k-GroupHard 
Leetcode Combination系列:39 & 77 & 40 & 216 & 17 MediumDFS
38. Count and SayEasy 
35. search Insert PositionEasy 
46.Permutation & 47.Permutation II
MediumDFS
5 Longest Palindromic SubstringMediumManarch / common
12. Integer to RomanMedium 
13. Roman to IntegerEasyHash-Map
8. String to IntegerMedium 
42. Trapping Rain WaterHard 
407. trapping rain water IIHardheap
11. Container with Most WaterMedium 
19 Remove Nth Node From End of ListMediumfast and slow pointers
23. Merge K sorted ListHardheap
234. Palindrome Linked ListEasystack
142. LinkedList Cycle IIMediumfast and slow pointers
141.Linked List Cycle 快慢指针Easyfast and slow pointers
leetcode Sum合集Easy & Mediummap
79.word searchMediumDFS with visited array
261.Graph Valid TreeMediumUnion Find to find circle
305.Number Of Islands IIHardUnion Find

转载于:https://www.cnblogs.com/yaoyudadudu/p/9187230.html

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值