solved climbing stairs

:

Author: SamTheKorean

climbing-stairs/samthekorean.py

@@ -0,0 +1,18 @@
+# Time complexity : O(n)
+# Space complexity : O(n)
+class Solution:
+    def climbStairs(self, n: int) -> int:
+        a = 1
+        b = 2
+        result = 0
+        if n == 1:
+            return a
+
+        if n == 2:
+            return b
+
+        for i in range(3, n + 1):
+            result = a + b
+            a, b = b, result
+
+        return result