_70. Climbing Stairs.md

70. Climbing Stairs

All prompts are owned by LeetCode. To view the prompt, click the title link above.

Back to top

---

First completed : May 22, 2024

Last updated : July 01, 2024

---

Related Topics : Math, Dynamic Programming, Memoization

Acceptance Rate : 53.36 %

---

Solutions

• e70 - bottomup.py
• e70 - topdown.py

Python

e70 - bottomup.py

class Solution:
    def climbStairs(self, n: int) -> int:
        
        return self.climbStairsBottomUp(0, n)

    @cache
    def climbStairsBottomUp(self, curr: int, n: int) -> int:
        if (curr == n) :
            return 1
        if (curr > n) :
            return 0
        return self.climbStairsBottomUp(curr + 1, n) + self.climbStairsBottomUp(curr + 2, n)

e70 - topdown.py

class Solution:
    record = {}
    def climbStairs(self, n: int) -> int:
        if (n == 0 or n == 1) :
            return 1
        if (n not in self.record) :
            self.record[n] = self.climbStairs(n - 1) + self.climbStairs(n - 2)
        return self.record[n]