题目:
解答:
class Solution {
public:
int climbStairs(int n) {
int a[1000];
a[0] = 0;
a[1] = 1;
a[2] = 2;
for (int i = 3; i <= n; i++)
{
a[i] = a[i - 1] + a[i - 2];
}
return a[n];
}
};
动态规划
看下别人的节省空间的代码:http://blog.csdn.net/kenden23/article/details/17377869
代码: