题解:https://leetcode-cn.com/problems/climbing-stairs/solution/pa-lou-ti-by-leetcode-solution/
class Solution {
public:
int climbStairs(int n) {
vector<int> result(n+1,1);
for(int i = 2; i <= n; ++i){
result[i] = result[i-1] + result[i-2];
}
return result[n];
}
};