还是我的递归好理解一些……
记得要用DP哦!
class Solution {
public:
int data[100] = {0};
int climbStairs(int n) {
if (n == 0)
return 0;
if (n == 1)
return 1;
if (n == 2)
return 2;
if (data[n] != 0)
return data[n];
data[n] = climbStairs(n - 1) + climbStairs(n - 2);
return data[n];
}
};
http://oj.leetcode.com/problems/climbing-stairs/