70 Climbing Stairs(Easy)
198 House Robber(Easy)
413 Arithmetic Slices(Medium)
这里只讨论用动态规划来做,试着从LeetCode101这本书中再发现一些不一样的东西,我先贴一下这三题的代码:
70 :Climbing Stairs(Easy)
int climbStairs(int n) {
if (n <= 2) return n;
int pre2 = 1, pre1 = 2, cur;
for (int i = 2; i < n; ++i) {
cur = pre1 + pre2;
pre2 = pre1;
pre1 = cur;
}
return c