Algorithm - 《LeetCode》

0001. Two Sum (E)
0002. Add two numbers (M)
0003. Longest Substring Without Repeating Characters (M)
0004. Median of Two Sorted Arrays (H)
0005. Longest Palindromic Substring (M)
0006. ZigZag Conversion (M)
0007. Reverse Integer (E)
0008. String to Integer (atoi) (M)
0009. Palindrome Number (E)
0010. Regular Expression Matching (H)
0011. Container With Most Water (M)
0012. Integer to Roman (M)
0013. Roman to Integer (E)
0014. Longest Common Prefix (E)
0015. 3Sum (M)
0016. 3Sum Closest (M)
0017. Letter Combinations of a Phone Number (M)
0018. 4Sum (M)
0019. Remove Nth Node From End of List (M)
0020. Valid Parentheses (E)
0021. Merge Two Sorted Lists (E)
0022. Generate Parentheses (M)
0023. Merge k Sorted Lists (H)
0024. Swap Nodes in Pairs (M)
0025. Reverse Nodes in k-Group (H)
0026. Remove Duplicates from Sorted Array (E)
0027. Remove Element (E)
0028. Implement strStr() (E)
0029. Divide Two Integers (M)
0030. Substring with Concatenation of All Words (H)
0031. Next Permutation (M)
0032. Longest Valid Parentheses (H)
0033. Search in Rotated Sorted Array (M)
0034. Find First and Last Position of Element in Sorted Array (M)
0035. Search Insert Position (E)
0036. Valid Sudoku (M)
0037. Sudoku Solver (H)
0038. Count and Say (E)
0039. Combination Sum (M)
0040. Combination Sum II (M)
0041. First Missing Positive (H)
0042. Trapping Rain Water (H)
0043. Multiply Strings (M)
0044. Wildcard Matching (H)
0045. Jump Game II (H)
0046. Permutations (M)
0047. Permutations II (M)
0048. Rotate Image (M)
0049. Group Anagrams (M)
0050. Pow(x, n) (M)
0051. N-Queens (H)
0052. N-Queens II (H)
0053. Maximum Subarray (E)
0054. Spiral Matrix (M)
0055. Jump Game (M)
0056. Merge Intervals (M)
0057. Insert Intervals (H)
0058. Length of Last Word (E)
0059. Spiral Matrix II (M)
0060. Permutation Sequence (M)
0061. Rotate List (M)
0062. Unique Paths (M)
0063. Unique Paths II (M)
64. Minimum Path Sum (M)
0065. Valid Number (H)
0066. Plus One (E)
0067. Add Binary (E)
69. Sqrt(x) (E)
0070. Climbing Stairs (E)
0071. Simplify Path (M)
0072. Edit Distance (H)
0074. Search a 2D Matrix (M)
75. Sort Colors (M)
77. Combinations (M)
0078. Subsets (M)
0079. Word Search (M)
0080. Remove Duplicates from Sorted Array II (M)
0081. Search in Rotated Sorted Array II (M)
0082. Remove Duplicates from Sorted List II (M)
83. Remove Duplicates from Sorted List (E)
0084. Largest Rectangle in Histogram (H)
0086. Partition List (M)
0088. Merge Sorted Array (E)
90. Subsets II (M)
0091. Decode Ways (M)
92. Reverse Linked List II (M)
93. Restore IP Addresses (M)
94. Binary Tree Inorder Traversal (M)
95. Unique Binary Search Trees II (M)
96. Unique Binary Search Trees (M)
0097. Interleaving String (M)
0098. Validate Binary Search Tree (M)
0099. Recover Binary Search Tree (H)
0100. Same Tree (E)
101. Symmetric Tree (E)
0102. Binary Tree Level Order Traversal (M)
0103. Binary Tree Zigzag Level Order Traversal (M)
104. Maximum Depth of Binary Tree (E)
0105. Construct Binary Tree from Preorder and Inorder Traversal (M)
0106. Construct Binary Tree from Inorder and Postorder Traversal (M)
0107. Binary Tree Level Order Traversal II (E)
108. Convert Sorted Array to Binary Search Tree (E)
0109. Convert Sorted List to Binary Search Tree (M)
0110. Balanced Binary Tree (E)
111. Minimum Depth of Binary Tree (E)
112. Path Sum (E)
113. Path Sum II (M)
0114. Flatten Binary Tree to Linked List (M)
116. Populating Next Right Pointers in Each Node (M)
117. Populating Next Right Pointers in Each Node II (M)
118. Pascal's Triangle (E)
0119. Pascal's Triangle II (E)
0120. Triangle (M)
0121. Best Time to Buy and Sell Stock (E)
0122. Best Time to Buy and Sell Stock II (E)
0123. Best Time to Buy and Sell Stock III (H)
0124. Binary Tree Maximum Path Sum (H)
0125. Valid Palindrome (E)
0127. Word Ladder (H)
0128. Longest Consecutive Sequence (M)
129. Root to Leaf Numbers (M)
130. Surrounded Regions (M)
0131. Palindrome Partitioning (M)
0133. Clone Graph (M)
0134. Gas Station (M)
136. Single Number (E)
137. Single Number II (M) (待学习)
0138. Copy List with Random Pointer (M)
0139. Word Break (M)
0140. Word Break II (H)
0141. Linked List Cycle (E)
0142. Linked List Cycle II (M)
0143. Reorder List (M)
144. Binary Tree Preorder Traversal (M)
145. Binary Tree Postorder Traversal (H)
146. LRU Cache (M)
0147. Insertion Sort List (M)
0148. Sort List (M)
149. Max Points on a Line (H)
0150. Evaluate Reverse Polish Notation (M)
0151. Reverse Words in a String (M)
0152. Maximum Product Subarray (M)
153. Find Minimum in Rotated Sorted Array (M)
0154. Find Minimum in Rotated Sorted Array II (H)
155. Min Stack (E)
0160. Intersection of Two Linked Lists (E)
162. Find Peak Element (M)
0165. Compare Version Numbers (M)
166. Fraction to Recurring Decimal (M)
167. Two Sum II - Input array is sorted (E)
168. Excel Sheet Column Title (E)
169. Majority Element (E)
0171. Excel Sheet Column Number (E)
172. Factorial Trailing Zeroes (E)
0173. Binary Search Tree Iterator (M)
0179. Largest Number (M)
0187. Repeated DNA Sequences (M)
0188. Best Time to Buy and Sell Stock IV (H)
0189. Rotate Array (E)
0190. Reverse Bits (E)
0191. Number of 1 Bits (E)
0198. House Robber (E)
0199. Binary Tree Right Side View (M)
200. Number of Islands (M)
201. Bitwise AND of Numbers Range (M)
202. Happy Number (E)
0203. Remove Linked List Elements (E)
0204. Count Primes (E)
205. Isomorphic Strings (E)
206. Reverse Linked List (E)
207. Course Schedule (M)
0208. Implement Trie (Prefix Tree) (M)
209. Minimum Size Subarray Sum (M)
0210. Course Schedule II (M)
0211. Add and Search Word - Data structure design (M)
212. Word Search Ⅱ (H) 待完善Trie
0213. House Robber II (M)
214. Shortest Palindrome (H) 待完善KMP
0215. Kth Largest Element in an Array (M)
0216. Combination Sum III (M)
217. Contains Duplicate (E)
219. Contains Duplicate II (E)
0220. Contains Duplicate III (M)
222. Count Complete Tree Nodes (M)
0223. Rectangle Area (M)
224. Basic Calculator (H)
225. Implement Stack using Queues (E)
226. Invert Binary Tree (E)
0227. Basic Calculator II (M)
0228. Summary Ranges (E)
0229. Majority Element II (M)
230. Kth Smallest Element in a BST (M)
231. Power of Two (E)
232. Implement Queue using Stacks (E)
0234. Palindrome Linked List (E)
235. Lowest Common Ancestor of a Binary Search Tree (E)
236. Lowest Common Ancestor of a Binary Tree (M)
237. Delete Node in a Linked List (E)
238. Product of Array Except Self (M)
0239. Sliding Window Maximum (H)
0240. Search a 2D Matrix II (M)
0241. Different Ways to Add Parentheses (M)
0242. Valid Anagram (E)
257. Binary Tree Paths (E)
0258. Add Digits (E)
0260. Single Number III (M)
263. Ugly Number (E)
0264. Ugly Number II (M)
0268. Missing Number (E)
0273. Integer to English Words (H)
0274. H-Index (M)
0275. H-Index II (M)
0278. First Bad Version (E)
0279. Perfect Squares (M)
0283. Move Zeroes (E)
0284. Peeking Iterator (M)
0287. Find the Duplicate Number (M)
0289. Game of Life (M)
0290. Word Pattern (E)
0292. Nim Game (E)
0297. Serialize and Deserialize Binary Tree (H)
0299. Bulls and Cows (E)
300. Longest Increasing Subsequence (M)
0303. Range Sum Query - Immutable (E)
0304. Range Sum Query 2D - Immutable (M)
0306. Additive Number (M)
0309. Best Time to Buy and Sell Stock with Cooldown (M)
0310. Minimum Height Trees (M)
0312. Burst Balloons (H)
0316. Remove Duplicate Letters (M)
0318. Maximum Product of Word Lengths (M)
319. Bulb Switcher (M)
0322. Coin Change (M)
0326. Power of Three (E)
0328. Odd Even Linked List (M)
0329. Longest Increasing Path in a Matrix (H)
332. Reconstruct Itinerary (M)
0334. Increasing Triplet Subsequence (M)
0337. House Robber III (M)
0338. Counting Bits (M)
0341. Flatten Nested List Iterator (M)
0342. Power of Four (E)
0343. Integer Break (M)
0344. Reverse String (E)
0345. Reverse Vowels of a String (E)
0347. Top K Frequent Elements (M)
0349. Intersection of Two Arrays (E)
0350. Intersection of Two Arrays II (E)
0354. Russian Doll Envelopes (H)
0367. Valid Perfect Square (E)
0376. Wiggle Subsequence (M)
0377. Combination Sum IV (M)
0382. Linked List Random Node (M)
0389. Find the Difference (E)
0394. Decode String (M)
0395. Longest Substring with At Least K Repeating Characters (M)
0399. Evaluate Division (M)
0401. Binary Watch (E)
0404. Sum of Left Leaves (E)
0409. Longest Palindrome (E)
0412. Fizz Buzz (E)
0413. Arithmetic Slices (M)
0416. Partition Equal Subset Sum (M)
0417. Pacific Atlantic Water Flow (M)
0421. Maximum XOR of Two Numbers in an Array (M)
0423. Reconstruct Original Digits from English (M)
0430. Flatten a Multilevel Doubly Linked List (M)
0434. Number of Segments in a String (E)
0435. Non-overlapping Intervals (M)
0436. Find Right Interval (M)
0437. Path Sum III (M)
0441. Arranging Coins (E)
0442. Find All Duplicates in an Array (M)
0445. Add Two Numbers II (M)
0449. Serialize and Deserialize BST (M)
0450. Delete Node in a BST (M)
0452. Minimum Number of Arrows to Burst Balloons (M)
0454. 4Sum II (M)
0456. 132 Pattern (M)
0458. Poor Pigs (H)
0459. Repeated Substring Pattern (E)
0461. Hamming Distance (E)
0462. Minimum Moves to Equal Array Elements II (M)
0463. Island Perimeter (E)
0470. Implement Rand10() Using Rand7() (M)
0474. Ones and Zeroes (M)
0478. Generate Random Point in a Circle (M)
0495. Teemo Attacking (M)
0497. Random Point in Non-overlapping Rectangles (M)
0498. Diagonal Traverse (M)
0509. Fibonacci Number (E)
0520. Detect Capital (E)
0524. Longest Word in Dictionary through Deleting (M)
0526. Beautiful Arrangement (M)
0532. K-diff Pairs in an Array (M)
0535. Encode and Decode TinyURL (M)
0538. Convert BST to Greater Tree (M)
547. Friend Circles (M)
0554. Brick Wall (M)
0556. Next Greater Element III (M)
0563. Binary Tree Tilt (E)
572. Subtree of Another Tree (E)
0575. Distribute Candies (E)
0581. Shortest Unsorted Continuous Subarray (M)
0583. Delete Operation for Two Strings (M)
0589. N-ary Tree Preorder Traversal (E)
0593. Valid Square (M)
0594. Longest Harmonious Subsequence (E)
0605. Can Place Flowers (E)
0609. Find Duplicate File in System (M)
0621. Task Scheduler (M)
0622. Design Circular Queue (M)
0623. Add One Row to Tree (M)
0630. Course Schedule III (H)
0637. Average of Levels in Binary Tree (E)
0645. Set Mismatch (E)
0647. Palindromic Substrings (M)
0662. Maximum Width of Binary Tree (M)
0665. Non-decreasing Array (M)
0667. Beautiful Arrangement II (M)
0669. Trim a Binary Search Tree (M)
0673. Number of Longest Increasing Subsequence (M)
0695. Max Area of Island (M)
0696. Count Binary Substrings (E)
0701. Insert into a Binary Search Tree (M)
0704. Binary Search (E)
0705. Design HashSet (E)
0706. Design HashMap (E)
0709. To Lower Case (E)
0713. Subarray Product Less Than K (M)
0714. Best Time to Buy and Sell Stock with Transaction Fee (M)
0729. My Calendar I (M)
0735. Asteroid Collision (M)
0745. Prefix and Suffix Search (H)
0746. Min Cost Climbing Stairs (E)
0752. Open the Lock (M)
0754. Reach a Number (M)
0763. Partition Labels (M)
0775. Global and Local Inversions (M)
0784. Letter Case Permutation (M)
0785. Is Graph Bipartite? (M)
0797. All Paths From Source to Target (M)
0799. Champagne Tower (M)
0804. Unique Morse Code Words (E)
0816. Ambiguous Coordinates (M)
0820. Short Encoding of Words (M)
0821. Shortest Distance to a Character (E)
0823. Binary Trees With Factors (M)
0824. Goat Latin (E)
0832. Flipping an Image (E)
0835. Image Overlap (M)
0841. Keys and Rooms (M)
0845. Longest Mountain in Array (M)
0849. Maximize Distance to Closest Person (M)
0856. Score of Parentheses (M)
0858. Mirror Reflection (M)
0859. Buddy Strings (E)
0865. Smallest Subtree with all the Deepest Nodes (M)
0869. Reordered Power of 2 (M)
0870. Advantage Shuffle (M)
0880. Decoded String at Index (M)
0881. Boats to Save People (M)
0890. Find and Replace Pattern (M)
0895. Maximum Frequency Stack (H)
0897. Increasing Order Search Tree (M)
0902. Numbers At Most N Given Digit Set (H)
0905. Sort Array By Parity (E)
0906. Super Palindromes (H)
0910. Smallest Range II (M)
0916. Word Subsets (M)
0923. 3Sum With Multiplicity (M)
0933. Number of Recent Calls (E)
0936. Stamping The Sequence (H)
0938. Range Sum of BST (E)
0941. Valid Mountain Array (E)
0946. Validate Stack Sequences (M)
0948. Bag of Tokens (M)
0949. Largest Time for Given Digits (E)
0952. Largest Component Size by Common Factor (H)
0953. Verifying an Alien Dictionary (E)
0957. Prison Cells After N Days (M)
0966. Vowel Spellchecker (M)
0967. Numbers With Same Consecutive Differences (M)
0968. Binary Tree Cameras (H)
0969. Pancake Sorting (M)
0970. Powerful Integers (M)
0971. Flip Binary Tree To Match Preorder Traversal (M)
0977. Squares of a Sorted Array (E)
0980. Unique Paths III (H)
0983. Minimum Cost For Tickets (M)
0987. Vertical Order Traversal of a Binary Tree (M)
0991. Broken Calculator (M)
0994. Rotting Oranges (M)
1007. Minimum Domino Rotations For Equal Row (M)
1009. Complement of Base 10 Integer (E)
1010. Pairs of Songs With Total Durations Divisible by 60 (M)
1015. Smallest Integer Divisible by K (M)
1022. Sum of Root To Leaf Binary Numbers (E)
1026. Maximum Difference Between Node and Ancestor (M)
1032. Stream of Characters (H)
1041. Robot Bounded In Circle (M)
1048. Longest String Chain (M)
1074. Number of Submatrices That Sum to Target (H)
1091. Shortest Path in Binary Matrix (M)
1094. Car Pooling (M)
1103. Distribute Candies to People (E)
1192. Critical Connections in a Network (H)
1209. Remove All Adjacent Duplicates in String II (M)
1217. Minimum Cost to Move Chips to The Same Position (E)
1249. Minimum Remove to Make Valid Parentheses (M)
1268. Search Suggestions System (M)
1283. Find the Smallest Divisor Given a Threshold (M)
1286. Iterator for Combination (M)
1288. Remove Covered Intervals (M)
1290. Convert Binary Number in a Linked List to Integer (E)
1291. Sequential Digits (M)
1302. Deepest Leaves Sum (M)
1305. All Elements in Two Binary Search Trees (M)
1306. Jump Game III (M)
1329. Sort the Matrix Diagonally (M)
1332. Remove Palindromic Subsequences (E)
1337. The K Weakest Rows in a Matrix (E)
1342. Number of Steps to Reduce a Number to Zero (E)
1344. Angle Between Hands of a Clock (M)
1345. Jump Game IV (H)
1354. Construct Target Array With Multiple Sums (H)
1360. Number of Days Between Two Dates (E)
1361. Validate Binary Tree Nodes (M)
1362. Closest Divisors (M)
1363. Largest Multiple of Three (H)
1365. How Many Numbers Are Smaller Than the Current Number
1366. Rank Teams by Votes (M)
1367. Linked List in Binary Tree (M)
1374. Generate a String With Characters That Have Odd Counts (E)
1375. Bulb Switcher III (M)
1376. Time Needed to Inform All Employees (M)
1377. Frog Position After T Seconds (H)
1379. Find a Corresponding Node of a Binary Tree in a Clone of That Tree (M)
1380. Lucky Numbers in a Matrix (E)
1381. Design a Stack With Increment Operation (M)
1382. Balance a Binary Search Tree (M)
1383. Maximum Performance of a Team (H)
1389. Create Target Array in the Given Order (E)
1390. Four Divisors (M)
1391. Check if There is a Valid Path in a Grid (M)
1392. Longest Happy Prefix (H)
1394. Find Lucky Integer in an Array (E)
1395. Count Number of Teams (M)
1396. Design Underground System (M)
1403. Minimum Subsequence in Non-Increasing Order (E)
1404. Number of Steps to Reduce a Number in Binary Representation to One (M)
1405. Longest Happy String (M)
1423. Maximum Points You Can Obtain from Cards (M)
1437. Check If All 1's Are at Least Length K Places Away (E)
1446. Consecutive Characters (E)
1457. Pseudo-Palindromic Paths in a Binary Tree (M)
1461. Check If a String Contains All Binary Codes of Size K (M)
1463. Cherry Pickup II (H)
1465. Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts (M)
1480. Running Sum of 1d Array (E)
1492. The kth Factor of n (M)
1510. Stone Game IV (H)
1539. Kth Missing Positive Number
1551. Minimum Operations to Make Array Equal (M)
1631. Path With Minimum Effort (M)
1640. Check Array Formation Through Concatenation (E)
1641. Count Sorted Vowel Strings (M)
1642. Furthest Building You Can Reach (M)
1646. Get Maximum in Generated Array (E)
1649. Create Sorted Array through Instructions (H)
1657. Determine if Two Strings Are Close (M)
1658. Minimum Operations to Reduce X to Zero (M)
1662. Check If Two String Arrays are Equivalent (E)
1663. Smallest String With A Given Numeric Value (M)
1673. Find the Most Competitive Subsequence (M)
1675. Minimize Deviation in Array (H)
1679. Max Number of K-Sum Pairs (M)
1680. Concatenation of Consecutive Binary Numbers (M)
1689. Partitioning Into Minimum Number Of Deci-Binary Numbers (M)
1695. Maximum Erasure Value (M)
1704. Determine if String Halves Are Alike (E)
1710. Maximum Units on a Truck (E)
1721. Swapping Nodes in a Linked List (M)