70.爬楼梯
斐波那契数列
class Solution {
public:
int climbStairs(int n) {
vector<int>ans={1,1};
for (int i = 2; i <n+1 ; ++i) {
int tmp_num=ans[i-2]+ans[i-1];
ans.push_back(tmp_num);
}
return ans[n];
}
};
class Solution:
def climbStairs(self, n):
"""
:type n: int
:rtype: int
"""
ans= [1,1]
for i in range(2,n+1):
ans.append(ans[i-1]+ans[i-2])
return ans[n]