立个贴来记录自己的转码路程

2019. 09. 25
1）学习状态及反省：以后还是利用零碎时间研究网课好了，整段时间刷题，来不及研究新题就快速过旧题
2）做题数量及内容：
0，希望以后不会再出现
3）对明天的规划：notes 1整理完，按一天一节课的进度review

2019. 09. 26-27
昨天早睡忘更新了
1）学习状态及反省：加快复习节奏
2）做题数量及内容：
Classical binary search
Search in sorted matrix 1
Find the closest element in sorted array
Find the first occurrence of target in a sorted array
Find the last occurrence of target in a sorted array
Find k closest in a sorted array
Search in unknown sized sorted array
Selection sort
3）对明天的规划：recursion1 + linked list + Udemy

2019. 09. 28
1）学习状态及反省：午饭之后的时间要利用好
2）做题数量及内容：
Merge sort
Quick sort
Move all 0s to the end 1
Rainbow sort
Reverse a LinkedList using iteration
Reverse a LinkedList using recursion
Find middle node of a LinkedList
Determine if a LinkedList has a circle
Insert a node in a sorted LinkedList
Merge two sorted LinkedLists into one
Reorder LinkedList
3）对明天的规划：linked list结束 + queue & stack

2019. 09. 29
1）学习状态及反省：就那样
2）做题数量及内容：
Merge sort LinkedList
Add two number
Check if a LinkedList is a palindrome
Remove element(s) from a LinkedList
Sort numbers with two stacks
Implement a queue using two stacks
Implement a stack using two queues
Add min() method for stack
Implement a deque using 3 stacks
3）对明天的规划：5. Binary Tree + 规划一下project

2019. 09. 30
1）学习状态及反省：下午效率太低
2）做题数量及内容：
Pre-order traversal
In-order traversal
Post-order traversal
Get height of a binary tree
Check if a binary tree is balanced
Check if a binary tree is symmetric
Check if a binary tree is binary search tree (BST)
3）对明天的规划：5. Binary Tree看完，复习基础notes中的tree部分，iterative traversal再过几遍

2019. 10. 01
1）学习状态及反省：把project, udemy和复习的schedule大致定一下
2）做题数量及内容：
Check if a binary tree is twisted identical
Print BST keys in the given range
Pre-order using iteration
In-order using iteration
Post-order using iteration
938. Range Sum of BST
3）对明天的规划：6. Heap & BFS1-2，2h Udemy

2019. 10. 02
1）学习状态及反省：以后有事的话尽量从其他地方抽出点时间完成定的任务
2）做题数量及内容：
(Heap) Find the smallest k elements from an unsorted array of size n
(BFS-1) Print a binary tree level by level
3）对明天的规划：BFS1-2过完，2h Udemy，定复习的schedule

2019. 10. 03-04
昨天又忘更了，以后得定个calendar提醒
1）学习状态及反省：勉强及格
2）做题数量及内容：
(BFS-1) Determine bipartite
(BFS-1) Determine if a binary tree is a complete binary tree
(BFS-2) Find the k-th smallest element in sorted matrix
Find all subsets of a string
Find all valid permutations of parentheses 1
Find all combinations that can sum up to the total value (coins)
Find all permutations of a string (no duplicate letter)
101. Symmetric Tree
102. Binary Tree Level Order Traversal
103. Binary Tree Zigzag Level Order Traversal
104. Maximum Depth of Binary Tree
110. Balanced Binary Tree
111. Minimum Depth of Binary Tree
3）对明天的规划：Hash Table & String I，2h Udemy

2019. 10. 05
1）学习状态及反省：udemy一定要挤时间看，自律自律自律，明天把今天剩下的hash table和string 1补上
2）做题数量及内容：
46. Permutations
47. Permutations II
58. Length of Last Word
69. Sqrt(x)
(String I) Remove certain chars from a string (in place)
(String I) Remove all leading/tailing/duplicate spaces in a string
(String I) Remove duplicated and adjacent letters 1
3）对明天的规划：
Hash Table & String 1 补完
开始String 2
2h Udemy

楼主加油，明天我跟着你的楼一起打卡。