
每日学习日记 2017-12-27
今日任务:
OS看完第二章
继续做DP经典题
博弈DP MiniMax: 能得到的是maximize the minimum gain
Coins in a Line 有取巧的return n % 3 != 0 ;办法
Coins in a Line II: 带有具体值的Conins in a Line 有两种方法:top-down and bottom-up
375 Guess Number Higher or Lower II 需要重做
Flip Game 1 2
- 1是2的一个引子
-
Nim game 三个选择的Coins 取巧办法%4
Palindrome Partitioning II
Burst Balloons
Scramble String
Longest Common Subsequence
One Edit Distance
Edit Distance
Minimum insertions to form a palindrome
WildCard Matching
Regular Expression Mathcing
Word Break
Word Break II
Interleaving String
Bomb Enemy
背包系列




近期评论