冬令时个人打卡贴

Daily 43

vector is way faster than using map

Day 44

Day 45

Day 46 Daily

Try DFS and BFS

Daily 44

补充内容 (2020-12-3 23:45):
should be Day 47

Day 45, Daily + high freq

Daily. 104. Max Depth Of BST

BFS

No.57 Insert Interval

find where I can put the new interval (nlogn x 2)
insert the previous and followings from original intervals
dunno why it is not fast.

No.449 Serialize and DeSerialize BST

BFS

No. Max width of BST

BFS
change the node value to record the width from the beginning.
remember to subtract from the "base" value, which is the first existing node

No.969

nlogn for sorting
n^2 for find the largest value and flip twice to place it correctly.
not optimal but seems the test cases are easy

Day 45, Daily + high freq

Daily. 104. Max Depth Of BST

BFS

No.57 Insert Interval

find where I can put the new interval (nlogn x 2)
insert the previous and followings from original intervals
dunno why it is not fast.

No.449 Serialize and DeSerialize BST

BFS

No. Max width of BST

BFS
change the node value to record the width from the beginning.
remember to subtract from the "base" value, which is the first existing node

No.969

nlogn for sorting
n^2 for find the largest value and flip twice to place it correctly.
not optimal but seems the test cases are easy

Daily 46

补充内容 (2020-12-3 23:45):
Should be day 49

Here is the missing day 48

Day 48, Daily + high freq


Daily. 104. Max Depth Of BST

BFS

No.57 Insert Interval

find where I can put the new interval (nlogn x 2)
insert the previous and followings from original intervals
dunno why it is not fast.

No.449 Serialize and DeSerialize BST

BFS

No. Max width of BST

BFS
change the node value to record the width from the beginning.
remember to subtract from the "base" value, which is the first existing node

No.969

nlogn for sorting
n^2 for find the largest value and flip twice to place it correctly.
not optimal but seems the test cases are easy

Day 49