题目:https://leetcode.com/problems/climbing-stairs/tabs/description
代码:
class Solution {
public:
int climbStairs(int n) {
int a[100];
a[0]=1,a[1]=2;
for(int i=2;i<100;i++){
a[i]=a[i-1]+a[i-2];
}
return a[n-1];
}
};
打表即可,递归会超时