class Solution {
public:
int climbStairs(int n) {
int prev, curr;
prev = 0; curr = 1;
for (int i = 0; i < n; i++)
{
int temp = curr;
curr += prev;
prev = temp;
}
return curr;
}
};
【LeetCode】Climbing Stairs
最新推荐文章于 2019-05-12 12:35:00 发布