電腦裡的魔法世界-希聲的部落格
小時候不懂電腦，覺得電腦真是神奇的不可思議好像魔法，長大後接觸了一點數學和資訊科學的知識，覺得人類真是聰明的不可思議...
2024年6月15日 星期六
Leetcode 筆記分類
1. Monotonic Stack
42. Trapping Rain Water [Hard]
84. Largest Rectangle in Histogram [Hard]
85. Maximal Rectangle [Hard]
2. Binary Search
4. Median of Two Sorted Arrays [Hard]
33. Search in Rotated Sorted Array [Medium]
34. Find First and Last Position of Element in Sorted Array [Medium]
35. Search Insert Position [Easy]
50. Pow(x, n) [Medium]
53. Maximum Subarray [Easy]
69. Sqrt(x) [Easy]
74. Search a 2D Matrix [Medium]
81. Search in Rotated Sorted Array II [Medium]
108. Convert Sorted Array to Binary Search Tree [Easy]
109. Convert Sorted List to Binary Search Tree [Medium]
3. DFS (recursive)
10. Regular Expression Matching [Hard]
22. Generate Parentheses [Medium]
17. Letter Combinations of a Phone Number [Medium]
37. Sudoku Solver [Hard]
39. Combination Sum [Medium]
40. Combination Sum II [Medium]
46. Permutations [Medium]
47. Permutations II [Medium]
51. N-Queens [Hard]
52. N-Queens II [Hard]
77. Combinations [Medium]
78. Subsets [Medium]
79. Word Search [Medium]
87. Scramble String [Hard]
90. Subsets II [Medium]
93. Restore IP Addresses [Medium]
97. Interleaving String [Hard]
111. Minimum Depth of Binary Tree [Easy]
112. Path Sum [Easy]
113. Path Sum II [Medium]
116. Populating Next Right Pointers in Each Node [Medium]
117. Populating Next Right Pointers in Each Node II [Medium]
4. BFS
102. Binary Tree Level Order Traversal [Medium]
103. Binary Tree Zigzag Level Order Traversal [Medium]
104. Maximum Depth of Binary Tree
107. Binary Tree Level Order Traversal II [Easy]
111. Minimum Depth of Binary Tree [Easy]
112. Path Sum [Easy]
113. Path Sum II [Medium]
116. Populating Next Right Pointers in Each Node [Medium]
5. Priority Queue
6. DP
5. Longest Palindromic Substring [Medium]
10. Regular Expression Matching [Hard]
42. Trapping Rain Water [Hard]
44. Wildcard Matching [Hard]
53. Maximum Subarray [Easy]
62. Unique Paths [Medium]
63. Unique Paths II [Medium]
64. Minimum Path Sum [Medium]
70. Climbing Stairs [Easy]
72. Edit Distance [Hard]
91. Decode Ways [Medium]
96. Unique Binary Search Trees [Medium]
97. Interleaving String [Hard]
115. Distinct Subsequences [Hard]
123. Best Time to Buy and Sell Stock III [Hard]
7. Linked List
19. Remove Nth Node From End of List [Medium]
21. Merge Two Sorted Lists [Easy]
23. Merge k Sorted Lists [Hard]
24. Swap Nodes in Pairs [Medium]
25. Reverse Nodes in k-Group [Hard]
82. Remove Duplicates from Sorted List II
83. Remove Duplicates from Sorted List [Easy]
86. Partition List [Medium]
92. Reverse Linked List II [Medium]
8. Bitwise Operation
29. Divide Two Integers [Medium]
78. Subsets [Medium]
90. Subsets II [Medium]
9. Tree
94. Binary Tree Inorder Traversal [Medium]
95. Unique Binary Search Trees II [Medium]
96. Unique Binary Search Trees [Medium]
98. Validate Binary Search Tree [Medium]
99. Recover Binary Search Tree [Hard]
100. Same Tree [Easy]
101. Symmetric Tree [Easy]
102. Binary Tree Level Order Traversal [Medium]
103. Binary Tree Zigzag Level Order Traversal [Medium]
104. Maximum Depth of Binary Tree
105. Construct Binary Tree from Preorder and Inorder Traversal [Medium]
106. Construct Binary Tree from Inorder and Postorder Traversal [Medium]
107. Binary Tree Level Order Traversal II [Easy]
108. Convert Sorted Array to Binary Search Tree [Easy]
109. Convert Sorted List to Binary Search Tree [Medium]
110. Balanced Binary Tree [Easy]
111. Minimum Depth of Binary Tree [Easy]
112. Path Sum [Easy]
113. Path Sum II [Medium]
114. Flatten Binary Tree to Linked List [Medium]
116. Populating Next Right Pointers in Each Node [Medium]
117. Populating Next Right Pointers in Each Node II [Medium]
124. Binary Tree Maximum Path Sum [Hard]
10. Two Pointer
11. Container With Most Water [Medium]
15. 3Sum [Medium]
16. 3Sum Closest [Medium]
18. 4Sum [Medium]
19. Remove Nth Node From End of List [Medium]
32. Longest Valid Parentheses [Hard]
42. Trapping Rain Water [Hard]
75. Sort Colors [Medium]
125. Valid Palindrome [Easy]
11. Greedy
45. Jump Game II [Hard]
55. Jump Game [Medium]
12. Stack
32. Longest Valid Parentheses [Hard]
71. Simplify Path [Medium]
13. Priority Queue / Heap
23. Merge k Sorted Lists [Hard]
14. Sliding Window
76. Minimum Window Substring [Hard]
Note:
1. Linked List 實作特別弱。
沒有留言:
張貼留言
較新的文章
較舊的文章
首頁
訂閱：
張貼留言 (Atom)
沒有留言:
張貼留言