题目来源:https://leetcode.com/problems/climbing-stairs/
问题描述
70. Climbing Stairs
Easy
You are climbing a stair case. It takes nsteps 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
------------------------------------------------------------
题意
走楼梯,一次可以走一步或两步,求n级楼梯有多少种不同的走法
------------------------------------------------------------
思路
递推,f[n] = f[n-1] + f[n-2]. 其中f[n-1]来自最后一跳走一步的情况,f[n-2]来自最后一跳走两步的情况
------------------------------------------------------------
代码
func climbStairs(n int) int {
if (n == 1) {
return 1
} else if (n == 2) {
return 2
}
a, b := 1, 2
for i:=3; i<=n; i++ {
a, b = b, a+b
}
return b
}