题目
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
题意
斐波那契数列
题解
C++代码
class Solution {
public:
int climbStairs(int n)
{
int res[n+1];
if(n==1)
return 1;
if(n==2)
return 2;
res[1]=1;
res[2]=2;
for(int i=3;i<=n;i++)
res[i]=res[i-1]+res[i-2];
return res[n];
}
};
python代码
class Solution(object):
def climbStairs(self, n):
"""
:type n: int
:rtype: int
"""
if n<3:
t = 3
else:
t = n
res=[0 for row in range(t+1)]
res[1]=1
res[2]=2
res[3]=3
for i in range(4,t+1):
res[i]=res[i-1]+res[i-2]
return res[n]