LeetCode练题——70. Climbing Stairs

1、题目

70. Climbing Stairs——Easy

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

2、我的解答

 # -*- coding: utf-8 -*-

 # @Time    : 2020/2/16 14:03

 # @Author  : SmartCat0929

 # @Email   : 1027699719@qq.com

 # @Link    : https://github.com/SmartCat0929

 # @Site    :

 # @File    : 70. Climbing Stairs.py

 class Solution:

     def climbStairs(self, n: int) -> int:

         if n < 3:

             return n

         count1, count2 = (1, 2)

         for i in range(2, n):

             count = count1 + count2

             count1 = count2

             count2 = count

         return count

 print(Solution().climbStairs(11))

巴特西

LeetCode练题——70. Climbing Stairs

最新文章

热门文章