From 56c0e955167a0cd8e0e56bf7198bd6799b98f26b Mon Sep 17 00:00:00 2001
From: marina <138340846+bt3gl-cryptographer@users.noreply.github.com>
Date: Mon, 7 Aug 2023 16:56:28 -0700
Subject: [PATCH] Update climbing_stairs.py

---
 dynamic_programming/climbing_stairs.py | 12 ++++++------
 1 file changed, 6 insertions(+), 6 deletions(-)

diff --git a/dynamic_programming/climbing_stairs.py b/dynamic_programming/climbing_stairs.py
index b5074b0..c699acd 100644
--- a/dynamic_programming/climbing_stairs.py
+++ b/dynamic_programming/climbing_stairs.py
@@ -13,7 +13,7 @@ def climb_stairs_o2n(n: int) -> int:
  
         if n == 0 or n == 1:
             return 1
-        return climb_stairs_o2n(n-1) + climb_stairs_o2n(n-2)
+        return climb_stairs_o2n(n - 1) + climb_stairs_o2n(n - 2)
  
 
 def climb_stairs_memoization(n: int) -> int:
@@ -24,7 +24,7 @@ def climb_stairs_memoization(n: int) -> int:
         if n == 0 or n == 1:
             return 1
         if n not in memo:
-            memo[n] = helper(n-1, memo) + helper(n-2, memo)
+            memo[n] = helper(n - 1, memo) + helper(n - 2, memo)
         return memo[n]
  
    return helper(n, memo)
@@ -36,7 +36,7 @@ def climb_stairs_optimized(n: int) -> int:
             return 1
         prev, curr = 1, 1
  
-        for i in range(2, n+1):
+        for i in range(2, n + 1):
             temp = curr
             curr = prev + curr
             prev = temp
@@ -49,10 +49,10 @@ def climb_stairs_tabulation(n: int) -> int:
         if n == 0 or n == 1:
             return 1
 
-        dp = [0] * (n+1)
+        dp = [0] * (n + 1)
         dp[0] = dp[1] = 1
         
-        for i in range(2, n+1):
-            dp[i] = dp[i-1] + dp[i-2]
+        for i in range(2, n + 1):
+            dp[i] = dp[i - 1] + dp[i - 2]
          
         return dp[n]