class Solution {
public:
int climbStairs(int n) {
int firster = 1;
int seconder = 2;
if(1 == n) {
return 1;
} else if(2 == n) {
return 2;
}
int i,result;
for(i=3; i<=n; i++) {
result = firster + seconder;
firster = seconder;
seconder = result;
}
return result;
}
};
[leetcode]Climbing Stairs
最新推荐文章于 2019-02-15 20:44:04 发布