在职争取用6个月准备跳槽，从今天开始记录

zqyzdsjdy 发表于 2019-5-29 04:59
请问LZ问啥半年就准备跳槽啊，不知道一年内经验的好不好找

呵呵，我这个人很被动，一旦待下来，可能就懒得动了。

2019/5/29 Wed
148. Sort List: merge sort, LinkedList.

2019/5/31 Fri
221. Maximal Square: dp
142. Linked List Cycle II: two pointers. Find the meet point in the cycle with slow and fast points, then find the cycle starting point.
322. Coin Change: dp

2019/6/6 Fri
1025. Divisor Game

2019/6/11 Tue:
array, easy:
1064. Fixed Point
1051. Height Checker
561. Array Partition I
dp, easy:
256. Paint House
121. Best Time to Buy and Sell Stock
303. Range Sum Query - Immutable

2019/6/15 Saturday, 树
589. N-ary Tree Preorder Traversal: 解法1: recursive, 解法 2: iterative with stack
590. N-ary Tree Postorder Traversal: 解法1：recursive，解法2：iterative with stack，visit 根节点，然后从左往右把子节点放在stack中，直到结束。注意：最后要把结果reverse。
965. Univalued Binary Tree: 解法1: recursive, 解法 2: iterative with stack

2019/6/16 Sunday, hash table
1086. High Five: 方法1：hash table + priority queue. 注意最后要把结果的vector按照id排序。 方法2：bucket sort. 复习了常用排序方法bubble, insertion, selection, merge, quick sort. TODO: 复习bucket sort, heap sort.

2019/6/17 Monday
897. Increasing Order Search Tree: depth first search

2019/6/18 Tuesday:
872. Leaf-Similar Trees: depth first search, easy
690. Employee Importance: depth first search, easy
704. Binary Search: binary searach, easy
944. Delete Columns to Make Sorted: easy, 没什么算法，就是把不升序的列算出来即可。
429. N-ary Tree Level Order Traversal: easy, level order travesal.