[第五期活动] 在职刷题打卡，目标工作日一天2题，周末一天5题

day 1 calculator 1- 3

day 3
41. First Missing Positive 首先意识到所有负数和0都没用，循环一遍都置换成比当前len大1的数；然后遇见一个数，取绝对值标记就可以了。corner case一个是数组为空，一个是数组里全是负数时。
45. Longest Mountain in Array 又没想出来= =，自己写了个版本，但是不能应对有重复元素的情况……理解然后抄答案了

Day 1:
11. Container With Most Water  
15. 3Sum

# day 2/2
- 543 Diameter of binary tree
- 111 Minimum depth of binary tree
- 104 Maximum depth of binary tree
今天主要弄了tree depth相关的，iterative有时候挺难写的。。

# Day 04
Minimum Domino Rotations For Equal Row
Find Median from Data Stream

Day1 11.04   2题
258. Add Digits
916. Word Subsets            学习了counter的build-in method

[Day 3][Total Day 15] 2019/11/4，Topic：Data Structure（Lintcode）
- 495. Implement Stack
- 494. Implement Stack by Two Queues
- 40. Implement Queue by Two Stacks
- 642. Moving Average from Data Stream
- 128. Hash Function
- 129. Rehashing
- 134. LRU Cache

day 2
Trapping Rain Water
3Sum
Merge k Sorted Lists
Reverse Linked List
Longest Palindromic Substring

# Day 01
- 1143 Longest Common Subsequence
- 1248 Count Number of Nice Subarrays

# Day 03
Data Stream as Disjoint Intervals