时隔很久重新开始刷题，复习一下一些做过的题型，同时热身，重复的题就不重新开笔记了，仅记录在这边每天刷了哪些有个小记录和小督促。
8.3
3. Subsets, Subsets II, Longest Palindrome
8.4
2. Valid Palindrome, Longest Palindrome Substring
8.5
3. Longest Palindromic Subsequence， strStr, strStr II
8.7
3. Last Position of Target, Maximum Number in Mountain Sequence, Find K Closest Elements
8.8
7. Search in a Big Sorted Array, Pow(x, n), Fast Power, Find Minimum in Rotated Sorted Array, Find Peak Element, First Bad Version, Search in Rotated Sorted Array
8.9
2. Recover Rotated Sorted Array， Rotate String
8.13
3. Middle of Linked List, Two Sum, Two Sum II - Input array is sorted
8.14
6. Two Sum III - Data structure design, Move Zeroes, Remove Duplicate Numbers in Array, Sort Integers, Sort Integers II, Sort Colors
8.28
1. Sort Colors II
8.29
2. Partition Array, 3Sum.
8.30
2. Kth Largest Element, Closest Binary Search Tree Value.
8.31
1. Kth Smallest Element in a BST
9.2
6. Regular Expression Matching, Wildcard Matching, Word Break II, Combinations, Split String, Closest Binary Search Tree Value II.
9.3
2. First Unique Character in a String, Moving Average from Data Stream
9.5
4. Merge K Sorted Lists, K Closest Points, Top k Largest Numbers, Insert Delete GetRandom O(1) - Duplicates allowed, Insert Delete GetRandom O(1)
9.6
5. Implement Queue by Two Stacks, Ugly Number II, Super Ugly Number, Ugly Number, LRU Cache