class Solution {
public:
int climbStairs(int n) {
if(n==1) return 1;
if(n==2) return 2;
int n1=1,n2=2,ret=0;
for(int count=3;count<=n;count++)
{
ret=n1+n2;
n1=n2;
n2=ret;
}
return ret;
}
};
Climbing Stairs
最新推荐文章于 2021-01-23 20:30:40 发布