class Solution {
public:
int climbStairs(int n) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
if (n == 1)
return 1;
else if (n == 2)
return 2;
int a = 1;
int b = 2;
for (int i = 3; i <= n; ++i)
{
int temp = a;
a = b;
b = temp + b;
}
return b;
}
};
[Leetcode] Climbing Stairs
最新推荐文章于 2019-02-15 20:44:04 发布