---
###### tags: `自我學習` `LeetCode` `C++`
---

# 【LeetCode】: 邁向光明之路 - C++

## 精選題型

- :heavy_check_mark: 1. Two Sum
- :heavy_check_mark: 2. Add Two Numbers
- :heavy_check_mark: 3. Longest Substring Without Repeating Characters
- :heavy_check_mark: 53. Maximum Subarray
- :heavy_check_mark: 226. Invert Binary Tree
- :heavy_check_mark: 268. Missing Number
- 542. 01 Matrix

## Easy

- [1. Two Sum](/Yyb2_nTFT8qaTJpOi7LkHg)
- `Array` `Hash Table`
- [9. Palindrome Number](/J2YE88zFSJehrnaNCX63-g)
- `Math`
- [13. Roman to Integer](/pGRGoC_TQDKfda11nHOfYQ)
- `Hash Table` `Math` `String`
- [14. Longest Common Prefix](/sPLRyhZlTbqZ4Xf17oOwLQ)
- `String`
- [20. Valid Parentheses](/8mvZRkB_T8u67yPR-sgm2g)
- `Sorting` `Stack`
- [21. Merge Two Sorted Lists](/1BZjag9FSoa5bLCs_be74Q)
- `Linked List` `Recursion`
- [35. Search Insert Position](/d-wXkfSZQ8iU9UZkJFXmyg)
- `Array` `Binary Search`
- [53. Maximum Subarray](/FA_lAHsdRbWVfnbxq_fGxg)
- `Array` `Divide and Conquer`
- [57. Insert Interval](/mlSFIXGSTdmGPYvPn0ypNw)
- `Array`
- [67. Add Binary](/68vA6qLHSI6-h0plA616Vg)
- `Math` `String` `Bit Manipulation`
- [70. Climbing Stairs](/EycXe_86QYSAHYYutn7Lvg)
- `Math` `Dynamic Programming` `Memoization`
- [100. Same Tree](/3Fg1llnPRa6Ah46Te4wlkw)
- `Tree` `Depth-First Search`
- [101. Symmetric Tree](/-qsNXgvGT0SEwHnvMycsZQ)
- `Tree` `Depth-First Search`
- [104. Maximum Depth of Binary Tree](/nC-S3Ih5Sx-SvEFjmVVqPQ)
- `Tree` `Depth-First Search`
- [108. Convert Sorted Array to Binary Search Tree](/XO3N6dAERAaXQMv2M0QFhw)
- `Array` `Divide and Conquer` `Tree`
- [110. Balanced Binary Tree](/Q4IkwOEkRXq_OHJqvHJmcQ)
- `Tree` `Depth-First Search` `Binary Tree`
- [118. Pascal's Triangle](/n2SfSFXqRUyXj9uNO7Z1Dg)
- `Array` `Dynamic Programming`
- [121. Best Time to Buy and Sell Stock](/reXbOEWwQx62Q17OoMUOxg)
- `Array` `Dynamic Programming`
- [125. Valid Palindrome](/BjsMMVRRRqSagN7ekUeuXw)
- `Two Pointers` `String`
- [136. Single Number](/FD6dK2WNTkq6ei9G-IUxVw)
- `Array` `Bit Manipulation`
- [141. Linked List Cycle](/7q4b5XQvTiOWjRwa_mCx6A)
- `Hash Table` `Linked List` `Two Pointers`
- [160. Intersection of Two Linked Lists](/TSGwnIZASM-OWDPHAlFX9w)
- `Hash Table` `Linked List` `Two Pointers`
- [169. Majority Element](/yBtqy8W4RSGjijA9Z7aBMA)
- `Array` `Hash Table` `Divide and Conquer`
- [190. Reverse Bits](/UXHxkCDmTPSrBqspSN5JAg)
- `Divide and Conquer` `Bit Manipulation`
- [191. Number of 1 Bits](/ynADA_E0SSmBQ5CT7_fSfQ)
- `Divide and Conquer` `Bit Manipulation`
- [206. Reverse Linked List](/3cEcId4iR_yLnKltaYr3Lg)
- `Linked List` `Recursion`
- [217. Contains Duplicate](/j1ufQQycT9-ka7_IBnGuEg)
- `Array` `Hash Table` `Sorting`
- [226. Invert Binary Tree](/cKJ47NTKTrS50BqTh4SoAw)
- `Tree` `Depth-First Search`
- [232. Implement Queue using Stacks](/f93xH5lpRVSbawLjy3-g5w)
- `Stack` `Design` `Queue`
- [234. Palindrome Linked List](/2zDdLYVeStmVwJe-u3yKKw)
- `Linked List` `Two Pointers` `Stack`
- [242. Valid Anagram](/2YhVB0WdQ0ywlVlD6UBgSw)
- `Hash Table` `String` `Sorting`
- [268. Missing Number](/-dFqJnlMQEilIG236odTYg)
- `Array` `Hash Table` `Math`
- [278. First Bad Version](/BO6tkXmfStqQbIn2Xcc4bA)
- `Binary Search` `Interactive`
- [283. Move Zeroes](/RiuPsxcuTPubbGcYGK3W5A)
- `Array` `Two Pointers`
- [338. Counting Bits](/x0puKc3GSUWH6w-sutq5kw)
- `Dynamic Programming` `Bit Manipulation`
- [383. Ransom Note](/vxujopRFS5i9t0WwuuvNpQ)
- `Hash Table` `String` `Counting`
- [409. Longest Palindrome](/F4v-2DKSRJeQwfcPzgDqtQ)
- `Hash Table` `String` `Greedy`
- [543. Diameter of Binary Tree](/BYK-NWu4SM6MG9YKPKZBlw)
- `Tree` `Depth-First Search` `Binary Tree`
- [572. Subtree of Another Tree](/7hbkFtBsRbiS7QjDhZIg6g)
- `Tree` `Depth-First Search` `String Matching`
- [704. Binary Search](/J6BXg2UKRuqYmCuWtrTgLg)
- `Array` `Binary Search`
- [705. Design HashSet](/fc0curLVR9Gwk52NOR785A)
- `Array` `Hash Table`
- [733. Flood Fill](/YpyqIvNaTlKHhgQtgv0fbA)
- `Array` `Depth-First Search`
- [844. Backspace String Compare](/DaTOn8S-SfGD71Z73QhdXw)
- `Two Pointers` `String` `Stack`
- [876. Middle of the Linked List](/LERlJIsqTj2iH9stfCr_0Q)
- `Linked List` `Two Pointers`
- [977. Squares of a Sorted Array](/IebsBB_dSAme1yriLeb0ZA)
- `Array` `Two Pointers` `Sorting`
- [1071. Greatest Common Divisor of Strings](/pbM1dPVtRGeY1Ze93_5h3Q)
- `Math` `String`
- [1290. Convert Binary Number in a Linked List to Integer](/HX9z5RGJRfys3IEIOZpZUg)
- `Linked List` `Math`

## Medium

- [3. Longest Substring Without Repeating Characters](/gcVrgk6OTyKpjMap99gUxA)
- `Hash Table` `String` `Sliding Window`
- [22. Generate Parentheses](/2UUJoiUYRXa99mk1KIZo_A)
- `String` `Dynamic Programming` `Backtracking`
- [39. Combination Sum](/qAUA7yxoS8in6W8itWfQfA)
- `Array` `Backtracking`
- [46. Permutations](/UtIeAsP9RiaUBz5uQytvXg)
- `Array` `Backtracking`
- [48. Rotate Image](/EW--il9nQ7CZwW_4uIAyQw)
- `Array` `Math` `Matrix`
- [49. Group Anagrams](/-H2kPOWyT9CZKHJDKT4eKw)
- `Array` `Hash Table` `String`
- [54. Spiral Matrix](/8PJXVce1TIWmXcIcFX_wyA)
- `Array` `Matrix` `Simulation`
- [55. Jump Game](/xsBfQEiESneSURJ2mtMtLg)
- `Array` `Dynamic Programming` `Greedy`
- [62. Unique Paths](/1PBDPZVcRNSMUCfACTYbfQ)
- `Math` `Dynamic Programming` `Combinatorics`
- [75. Sort Colors](/ceHQtLPfR1KPkSmzCtjDbw)
- `Array` `Two Pointers` `Sorting`
- [98. Validate Binary Search Tree](/3weRNhCDT_6tNp6fs2uiBw)
- `Tree` `Depth-First Search`
- [102. Binary Tree Level Order Traversal](/YLK-KXTfRJiYNFgJ-PcMXQ)
- `Tree` `Breadth-First Search` `Binary Tree`
- [103. Binary Tree Zigzag Level Order Traversal](/wYB0vJIiQROUWuH8x_USzg)
- `Tree` `Breadth-First Search` `Binary Tree`
- [105. Construct Binary Tree from Preorder and Inorder Traversal](/CwgmImHUTty-NkpjaGsEAA)
- `Array` `Hash Table` `Divide and Conquer`
- [133. Clone Graph](/4rXzz53GQ16fIhmTPVt9HQ)
- `Hash Table` `Depth-First Search`
- [134. Gas Station](/KWMG_FtzThGXd32Mr834Ww)
- `Array` `Greedy`
- [148. Sort List](/pEHzPaSPQ7CGAc_swsueBg)
- `Linked List` `Two Pointers`
- [150. Evaluate Reverse Polish Notation](/7XWKr--bSrekyxKwCnYdJQ)
- `Array` `Math` `Stack`
- [152. Maximum Product Subarray](/tKD4yVEZQySdbDu38lUiiA)
- `Array` `Dynamic Programming`
- [155. Min Stack](/B7-pWLXfRA-exGsquq0uNQ)
- `Stack` `Design`
- [189. Rotate Array](/fhLWEDQQRMW4QSwsC3-ccg)
- `Array` `Math` `Two Pointers`
- [198. House Robber](/aWXEv80WQk-2afYgf9dnVg)
- `Array` `Dynamic Programming`
- [199. Binary Tree Right Side View](/1cYtP0VaTTOnq2svc9Dfmg)
- `Tree` `Depth-First Search`
- [200. Number of Islands](/Ai-d3jbxQ7imD9uy73MfOw)
- `Array` `Depth-First Search`
- [230. Kth Smallest Element in a BST](/aSpVoOWIRRazsdNQKRwjDQ)
- `Tree` `Depth-First Search`
- [235. Lowest Common Ancestor of a Binary Search Tree](/sSUPEdXWSaOFOL1berCPSQ)
- `Tree` `Depth-First Search`
- [236. Lowest Common Ancestor of a Binary Tree](/1e4_ZE7qQV-E41lb-Zw0bg)
- `Tree` `Depth-First Search` `Binary Tree`
- [238. Product of Array Except Self](/4Lqg7tfUTNaKhUUqXMu1lw)
- `Array` `Prefix Sum`
- [287. Find the Duplicate Number](/mhTKX3d5RomUFABbT-N-sg)
- `Array` `Two Pointers` `Binary Search`
- [322. Coin Change](/VneQpxL9QX6b8lyLim3r6A)
- `Depth-First Search` `Graph` `Eulerian Circuit`
- [328. Odd Even Linked List](/RRY24qTtS7GFhtFLUueELA)
- `Linked List`
- [438. Find All Anagrams in a String](/GOIh2wI-TzSpmJjhSjCyzQ)
- `Hash Table` `String` `Sliding Window`
- [528. Random Pick with Weight](/ibSYSPwJTAaBoJ_laE1Lcw)
- `Math` `Binary Search` `Prefix Sum`
- [973. K Closest Points to Origin](/dw3zZUy-TfSCNMykEplx2Q)
- `Array` `Math` `Divide and Conquer`