add white's solution

Rabbittee · Aug 26, 2021 · 49ece15 · 49ece15
1 parent 56195d6
commit 49ece15
Show file tree

Hide file tree

Showing 2 changed files with 16 additions and 0 deletions.
diff --git a/2021-08/2021-08-26 (day39)/White/README.md b/2021-08/2021-08-26 (day39)/White/README.md
@@ -0,0 +1,6 @@
+# leetcode
+Runtime: 43 ms, faster than 6.96% of Python3 online submissions for Climbing Stairs.
+Memory Usage: 14.3 MB, less than 44.80% of Python3 online submissions for Climbing Stairs.
+
+# fibonacci
+https://en.wikipedia.org/wiki/Fibonacci_number
diff --git a/2021-08/2021-08-26 (day39)/White/climbing_stairs.py b/2021-08/2021-08-26 (day39)/White/climbing_stairs.py
@@ -0,0 +1,10 @@
+class Solution:
+    def climbStairs(self, n: int) -> int:
+        if n <= 2: 
+            return n
+
+        a, b, res = 1, 1, 2       
+        for i in range(1, n-1):
+            a, b = b, res
+            res = a + b      
+        return res