70. Climbing Stairs
Easy
189470FavoriteShare
You are climbing a stair case. It takes n steps to reach to the top.
Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?
Note: Given n will be a positive integer.
Example 1:
Input: 2 Output: 2 Explanation: There are two ways to climb to the top. 1. 1 step + 1 step 2. 2 steps
Example 2:
Input: 3 Output: 3 Explanation: There are three ways to climb to the top. 1. 1 step + 1 step + 1 step 2. 1 step + 2 steps 3. 2 steps + 1 step
这道题的关键在于找规律,找到规律后就好办了:
1 1
2 2
3 1+2=3
4 3+2=5
5 5+3
n 第(n-1)算出的结果, 加上第(n-2)算出的结果。
代码很简单:
class Solution {
public:
int climbStairs(int n) {
if(n==1)return 1;
if(n==2)return 2;
int i=1;
int a=1;
int b=2;
int ans=1;
while(i<=n-2)
{
ans=b+a;
a=b;
b=ans;
i++;
}
return ans;
}
};