在职刷题打卡，目标工作日一天2题，周末一天5题

今天脑子不太清楚，感觉该复习了
补上这几天的题
Floyd & Brent：202，287，108，110，349
Greedy：135，121，122，58
BFS：101，103，111

补前天：
Partition Array for Maximum Sum: dp，还挺难想的。。。不知道这个题怎么打上了graph的标签
Regions Cut By Slashes: 奇葩的graph题，一看到region（connected component）就应该想到union find，如何定义node实在是太奇思妙想了
Evaluate division:一直以为这题只能dfs/bfs，没想到union find也能做，只有connected component的内部node才能互相evaluate，

#Day_15

完成 * 2:
LC 12. Integer to Roman
LC 767. Reorganize String

Day 3:
1. Word Ladder II: bfs + dfs; Use bfs to construct a graph-like structure, recording distance and nextNodes, and use dfs to print the path.
2. Sliding Puzzle: bfs; trick is to convert board to string, and pay attention to how to get the next state of the board(string).
3. Open the Lock: bfs; trick is how to get from 9 to 0, and 0 to 9, and corner case includes the dead set contains start or target

Range Addition
missing number

#Day_16

Finished * 2:
LC 935. Knight Dialer
LC 635. Design Log Storage System

Day 4
1. LintCode Build Post Office, is similar to LeetCode Shortest Distance from All Buildings. Need to be able to break down the approach into small pieces, bfs from every house to every empty on the board, record the times that the empty is visited and the add up the distance from the house to the empty, do a final iteration to get the smallest distance sum.

打卡
Leetcode
882
847

Find the Duplicate Number
链表找环，和binary search，两种方法
Decode String
stack

今天傻逼了就刷了一道... regular expression,刷了n遍了依旧每次都错，而且这傻逼题也不咋考。。。