70. Climbing Stairs (斐波那契通项公式)

70. Climbing Stairs

Easy

6585210Add to ListShare

You are climbing a staircase. It takes n steps to reach the top.

Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?

 

Example 1:

Input: n = 2
Output: 2
Explanation: There are two ways to climb to the top.
1. 1 step + 1 step
2. 2 steps

Example 2:

Input: n = 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

 

Constraints:

• 1 <= n <= 45

class Solution:
    def climbStairs(self, n: int) -> int:
        """
        解题思路：a1,a2分别代表到上一个数和到上上个数需要的步数，
        当前数对于a1只需要+1即可，有a1个可能
        当前数对于a2只需要+2即可，有a2个可能
        时间复杂度：O(n)，空间复杂度：O(1)
        """
        if n <= 3:
            return n
        a1, a2 = 3, 2
        for i in range(4, n + 1):
            tmp = a1
            a1 = a1 + a2
            a2 = tmp
        return a1