class Solution {
public:
int climbStairs(int n) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
if (n == 0 || n == 1)
{
return 1;
}
int a0 = 1;
int a1 = 1;
while(--n)
{
int tmp = a1;
a1 += a0;
a0 = tmp;
}
return a1;
}
};
LeetCode-Climbing Stairs
最新推荐文章于 2024-10-09 22:28:58 发布