LeetCode-70 Climbing Stairs

Description

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?

Constraints:
1 <= n <= 45

Example

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.
4. 1 step + 1 step + 1 step
5. 1 step + 2 steps
6. 2 steps + 1 step

Submissions

解题思路首先确定爬楼梯规律，当第一节时有一种方法，第二节时有两种方法，第三节时有三种方法，依次类推，当第n节时方法数为n-1和n-2节的方法数之和。因此定义一个方法集合为res,依次遍历台阶数并添加方法数即可。
实现代码如下：

class Solution:
    def climbStairs(self, n: int) -> int:
        res = [0, 1, 2]
        for i in range (3, n+1):
            res.append(res[-1]+res[-2])
        return res[n]