[LeetCode] 70. Climbing Stairs

Python

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