70. Climbing Stairs

发布时间：2020-12-14 03:46:28 所属栏目：大数据来源：网络整理

导读：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. ? ? class Solution(object):

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.

class Solution(object):
    def climbStairs(self,n):
        """
        :type n: int
        :rtype: int
        """
        if n == 0 :
            return 0
        if n == 1 :
            return 1
        if n == 2 :
            return 2
        
        one = 1
        second = 2
        
        for i in range(2,n,1):
            three = one+second
            one = second
            second = three
        
        return three

以上

（编辑：李大同）

【声明】本站内容均来自网络，其相关言论仅代表作者个人观点，不代表本站立场。若无意侵犯到您的权利，请及时与联系站长删除相关内容!