【目录】Leetcode
Leetcode
1、动态规划
- Palindrome Partitioning II(hard) ☆
- Distinct Subsequences(hard)
- Edit Distance (hard)
- Interleaving String (hard)
- Regular Expression Matching (hard) ★
- Wildcard Matching(hard) ★ 大神太牛了
- Longest Valid Parentheses (hard)★
- Scramble String (hard)★
- Maximal Rectangle (hard)★
- Unique Binary Search Trees (middle)☆
- Minimum Path Sum(easy)
- Unique Binary Search Trees II (middle)☆
- Unique Binary Search Trees (middle)☆
- Unique Path ||(easy)
- Unique Path(easy)
- triangle(easy)
- Decode Ways(medium)
- House Robber & House Robber II(middle)
2、回溯
- Restore IP Addresses (middle)
- Subsets II (middle) ☆
- Word Search (middle)
- Permutations (middle)
- Permutation Sequence (middle)
- Palindrome Partitioniong (middle) (*^__^*)
- Gray Code (middle)
- Generate Parentheses (middle)☆
- Letter Combinations of a Phone Number(middle)
- Combinations (middle)
- Combination Sum III(middle)
3、排序
- Sort Colors(middle)☆
- Sort List (middle)
- Largest Number ★
- Insertion Sort List (middle)
- Maximum Gap(hard)★
- First Missing Positive(hard) ☆
- 题目36 数组中的逆序对
4、指针
- Convert Sorted List to Binary Search Tree (middle)
- Remove Duplicates from Sorted List (easy)
- Remove Nth Node From End of List(easy)
- Binary Tree Zigzag Level Order Traversal (middle)
- Swap Nodes in Pairs (middle)
- Reverse Nodes in k-Group (hard)☆
- Copy List with Random Pointer (hard)
- Linked List Cycle II (middle)
- Rotate List(middle)
- Remove Duplicates from Sorted List II (middle)
- Merge Two Sorted Lists(easy)
- Partition List(middle)
- Reverse Linked List II (middle)
- Reorder List (middle)
- Remove Linked List Elements(easy)
- Reverse Linked List(easy)
5、Hash
- Repeated DNA Sequences(middle)★
- Max Points on a Line(hard)☆
- Anagrams (middle)
- Minimum Window Substring (hard) ★
6、树
- 【二叉树遍历】中序
- Path Sum I & II(middle)
- Populating Next Right Pointers in Each Node I & II(middle)
- Binary Tree Right Side View(middle)
- Same Tree(easy)
- Binary Tree Maximum Path Sum (medium)
- Binary Tree Postorder Traversal (hard) ☆
- Minimum Depth of Binary Tree (easy)
- Convert Sorted Array to Binary Search Tree (easy)
- Binary Tree Preorder Traversal (middle)★
- Sum Root to Leaf Numbers(hard)
- Binary Search Tree Iterator(middle)
- Flatten Binary Tree to Linked List (middle)
- Validate Binary Search Tree(middle)
- Balanced Binary Tree(middle)
- Binary Tree Level Order Traversal I & II
- 【leetcode】Symmetric Tree
7、数组
- Set Matrix Zeroes(middle)
- Spiral Matrix(middle)
- Spiral Matrix II (middle)
- Search in Rotated Sorted Array (hard)
- Search in Rotated Sorted Array II(middle)☆
- Search for a Range(middle)
- search Insert Position(middle)
- Rotate Image(middle)
- Remove Element (easy)
- Merge Intervals(hard)
- Jump Game I & II (hard)
- Find Minimum in Rotated Sorted Array I & II (middle)
- Remove Duplicates from Sorted Array I & II(middle)
- Pascal's Triangle I & II (middle)
- Longest Consecutive Sequence(hard)☆
- Text Justification(hard) ☆
- Next Permutation(middle)
- First Missing Positive(hard) ☆
- 题目20 顺时针打印矩阵
8、位操作
- Number of 1 Bits (easy)
- Reverse Bits(middle)
- Bitwise AND of Numbers Range(middle)
- Single Number II (medium) ★ 自己没做出来....
- Single Number (Medium) ☆
9、BFS & DFS
- Surrounded Regions(middle)☆
- Number of Islands(middle)
- Word Search II(hard)★
- Course Schedule(middle)☆
10、字符串
- Compare Version Numbers(middle)
- Excel Sheet Column Title & Excel Sheet Column Number (easy)
- Reverse Words in a String(hard)☆
- Substring with Concatenation of All Words (hard) ★
- atoi (hard) ★
- Count and Say (easy)
- Isomorphic Strings(easy)
- Integer to Roman & Roman to Integer(easy)
- Implement strStr() (easy)
- Shortest Palindrome(hard)★
11、游标
12、二分
13、堆
14、其他
- Candy(hard) 自己做出来了 但别人的更好
- Search a 2D Matrix (easy)
- 3Sum (medium)
- Subsets (Medium) ☆
- Plus One (easy)
- Climbing Stairs (easy)
- Best Time to Buy and Sell 3 (hard) 自己做出来了 但别人的更好
- Best Time to Buy and Sell 2(too easy)
- Best Time to Buy and Sell (easy)
- Valid Sudoku (easy)
- Two Sum (easy)
- length of last word (easy)
- Reverse Integer(middle)☆
- Factorial Trailing Zeroes(easy)
- Evaluate Reverse Polish Notation(middle)
- Min Stack(easy)
- LRU Cache(hard)★
- Happy Number(easy)
- Count Primes(easy)