LeetCode 刷题总结

最近找工作，免不了看CC150 刷 LeetCode 来练手，练习之余也向各路大神 系统并且深入的学习、巩固一下算法知识。
一. 线性表
1. 数组
    Remove Duplicates from Sorted Array
    Remove Duplicates from Sorted Array II
    Search in Rotated Sorted Array
    Search in Rotated Sorted Array II
    Median of Two Sorted Arrays
    Longest Consecutive Sequence
    3Sum
    3Sum Closet
    4Sum
    Remove Element
    Next Permutation
    Permutation Sequence
    Valid Sudoku
    Trapping Rain Water
    Rotate Image
    Plus One
    Climbing Stairs
    Gray Code
    Set Matrix Zeroes
    Gas Station
    Candy
    Single Member
    Single Member II
2. 单链表
    Add Two Numbers
    Reverse Linked List II
    Partition List
    Remove Duplicates from Sorted List
    Remove Duplicates from Sorted List II
    Rotate List
    Remove Nth Node From End of List
    Swap Nodes in Pairs
    Reverse Nodes in k-Group
    Copy List with Random Pointer
    Linked List Cycle
    Linked List Cycle II
    Reorder List
二. 字符串
    Valid Palindrome
    Implement strStr()
    String to Integer(atoi)
    Add Binary
    Longest Palindromic Substring
    Regular Expression Matching
    Wildcard Matching
    Longest Common Prefix
    Valid Number
    Integer to Roman
    Roman to Integer
    Count and Say
    Anagrams
    Simplify Path
    Length of Last Word
三. 栈和队列
1. 栈
    Valid Parentheses
    Longest Valid parentheses
    Largest Rectangle in Histogram
2. 队列
四. 树
1. 二叉树的遍历
    Binary Tree Preorder Traversal
    Binary Tree Inorder Traversal
    Binary Tree Postorder Traversal
    Binary Tree Level Order Traversal
    Binary Tree Level Order Traversal II
    Binary Tree Zigzag Level Order Traversal
    Recover Binary Search Tree
    Same Tree
    Symmetric Tree
    Balanced Binary Tree
    Flatten Binary Tree to Linked List
    Populating Next Right Pointers in Each Node II
2. 二叉树的构建
    Construct Binary Tree from Preorder and Inorder Traversal
    Construct Binary Tree from Inorder and Postorder Traversal
3. 二叉查找树
    Unique Binary Search Trees
    Unique Binary Search Trees II
    Validate Binary Search Tree
    Convert Sorted Array to Binary Search Tree
    Convert Sorted List to Binary Search Tree
4. 二叉树的递归
    Minimum Depth of Binary Tree
    Maximum Depth of Binary Tree
    Path Sum
    Path Sum II
    Binary Tree Maximum Path Sum
    Populating next Right Pointers in Each Node
    Sum Root to Leaf Numbers
五. 排序
    Merge Sorted Array
    Merge Two Sorted Lists
    Merge k Sorted Lists
    First Missing Positive
    Sort Colors
六. 查找
    Search for a Range
    Search Insert Position
    Search a 2D Matrix
七. 暴力枚举法
    Subsets
        递归
        迭代  
    Subsets II
        递归
        迭代
    Permutations
        next_permutation()
        重新实现next_permutation()
        递归
    Permutations II
        next_permutation()
        重新实现next_permutation()
        递归
    Combinations
        递归
        迭代
    Letter Combinations of a Phone Number
        递归
        迭代
八. 广度优先搜索
    Word Ladder
    Word Ladder II
    Surrounded Regions
九. 深度优先搜索
    Palindrome Partitioning
    Unique Paths
    Unique Paths II
    N-Queens
    N-Queens II
    Restore IP Addresses
    Combination Sum
    Combination Sum II
    Generate Parentheses
    Sudoku Solver
    Word Search
十. 分治法
    Pow(x,n)
    Sqrt(x)
十一. 贪心法
    Jump Game
    Jump Game II
    Best Time to Buy and Sell Stock
    Best Time to Buy and Sell Stock II
    Longest Substring Without Repeating Characters
    Container With Most Water
十二. 动态规划
    Triangle
    Maximum Subarray
    Palindrome Partitioning II
    Maximal Rectangle
    BestTime to Buy and Sell Stock III
    Interleaving String
    Scramble String
    Minimum Path Sum
    Edit Distance
    Decode Ways
    Distinct Subsequences
    Word Break
    Word Break II
十三. 图
    Clone Graph
十四. 细节实现题
    Reverse Integer
    Palindrome Number
    Two Sum
    Insert Interval
    Merge Intervals
    Minimum Window Substring
    Multiply Strings
    Substring with Concatenation of All Words
    Pascal‘s Triangle
    Pascal‘s Triangle II
    Spiral Matrix
    Spiral Matrix II
    Zigzag Conversion
    Divide Two Integers
    Text Justification