开始刷题追梦，只要相信就成功了一半

以前有朋友告诉我在职刷题有多么辛苦，需要战胜下班回家的疲倦，需要应付工作生活的纷纷扰扰，很难坚持下去。 但是如果有一个梦想实现的机会在那里，为什么不去试一试呢？开始刷题跳槽，相信我的愿望一定能达成~

10/1/18

Mock:
Student Attendance Record I(Easy) 6min52
Add Digits(Easy) 2min40
Largest Number(Medium) 12min4
4Sum(Medium)12min13
Maximum Distance in Arrays(Easy) 8min6


Tree:
N-ary Tree Level Order Traversal(Easy) 3min27
Insert into a Binary Search Tree(Medium)9min55
Maximum Binary Tree（Medium）Fail

10/2/18
Mock:
Find Bottom Left Tree Value(M)2min52
Word Abbreviation(H) 50min
Find Permutation(M)18m9
My Calendar II(M) 10m4
Find Mode in Binary Search Tree(E)17m6

10/9/18
617. Merge Two Binary Trees(E) 3m12
538. Convert BST to Greater Tree(E) F
654. Maximum Binary Tree(M)13m15
894. All Possible Full Binary Trees(M) 20m12

最近工作有点忙，压力有点大，好不容易今天有点时间，赶紧刷几道题压压惊

10/10/19
501. Find Mode in Binary Search Tree(E) 30m11
513. Find Bottom Left Tree Value(M) 2m26
297. Serialize and Deserialize Binary Tree(H) F
99. Recover Binary Search Tree(H) 11m2

下班后洗洗涮涮就不知不觉的到了11点，这时候要抽出时间来刷题的确考验意志力，以后一定要挤出更多时间

10/14/18
Easy:
101. Symmetric Tree (2m01)
104. Maximum Depth of Binary Tree (3m12)
112. Path Sum (F)
429. N-ary Tree Level Order Traversal (5m01)

Medium:
250. Count Univalue Subtrees (26m12)
106. Construct Binary Tree from Inorder and Postorder Traversal (10m)
105. Construct Binary Tree from Preorder and Inorder Traversal(4m31)
236. Lowest Common Ancestor of a Binary Tree(F)

11/5/18
Medium:
905. Sort Array By Parity(E: 5m46s)
450.Delete Node in a BST(M: F)
208. Implement Trie (Prefix Tree)(M: 16m43s)
250. Count Univalue Subtrees(M: F)
829. Consecutive Numbers Sum(H: F)

理解清楚题意很重要