当前位置：网站首页>Dynamic planning to climb the stairs

Dynamic planning to climb the stairs

2022-07-29 16:58:00 【Artificial Intelligence Zeng Xiaojian】

class Solution:
    @lru_cache(None)
    def climbStairs(self, n: int) -> int:
        if n == 0:
            return 0
        elif n == 1:
            return 1
        elif n == 2:
            return 2

        return self.climbStairs(n - 1) + self.climbStairs(n - 2)

class Solution:
    @lru_cache(None)
    def climbStairs(self,n:int) -> int:
        if n == 0:
            return 0
        elif n ==1:
            return 1
        elif n ==2:
            return 2
        return self.climbStairs(n-1) +self.climbStairs(n-2)

原网站

版权声明
本文为[Artificial Intelligence Zeng Xiaojian]所创，转载请带上原文链接，感谢
https://yzsam.com/2022/210/202207291558477314.html