九月刷题给米接龙活动（小伙伴们冲冲冲）

九月Day3 dfs+bfs 稍微找到点门路，感觉做binary tree更轻松些，general的变数太多了

今天刷的不多 惭愧 被tle触发了拖延症...

9.03 Day 3: 今天非常忙，只做了两题。

09.03 四道题打卡～

LC 33, LC 34 （提交了三次才对真是醉了）
二分不能小看，果然是10个人9个错啊

20200903:
3: 0235, 0236, 1123, 1236
4: 0124, 1316
5: 0214

09/03
一道新题一道老题，效率太低

今儿就一道题，加班累死了，真服了奋斗b了。有什么比整组都加班让人绝望的，大概就是自己本来不想加但也要被迫加了吧。。

9月刷题第2天：
1. Duplicate Zeros
2. Longest Increasing Subsequence
3. Longest Increasing Path in Binary Tree
为什么给上面人加米的选项不出来了。。。什么情况。。。

Sep 3
string,  简单的就不打卡了

247.
# MEDIUM

# when n = 1
#     we have ["1","0","8"]
# when n = 2:
#     we have ["11","69","88","96","00"]
# n = 3:
#     we have ["111","101","181","619","609","689","818","808","888","916","906","986"]
#     which is ["1","0","8"] inserted in the mid of ["11","69","88","96","00"]

459
# EASY
# KMP
# only build prefix
# ex.  input = ababa
#     prefix[0] = 0
#     prefix[1] = 0   
#     prefix[2] = 1   a,b,a
#     prefix[3] = 2   ab ab
#     prefix[4] = 3   aba  aba

68
# HARD

# 1. check length + counts of word + current word with maxWidth
# 2. round robin
#     maxWidth - lenght = number of spaces
#     loop through number of spaces times
#         each time assign a space to a word[0] -word[len]

# Time O(N)  Space O(N)