Merge pull request #312 from Rabbittee/feature/day39_Tim_solution

add Tim's py solution
Rabbittee · Aug 26, 2021 · a7b055b · a7b055b
2 parents 1b0f933 + 9310356
commit a7b055b
Show file tree

Hide file tree

Showing 3 changed files with 18 additions and 0 deletions.
diff --git a/2021-08/2021-08-26 (day39)/Tim/README.md b/2021-08/2021-08-26 (day39)/Tim/README.md
@@ -0,0 +1,7 @@
+#### Idea: Ways to climb (N) steps = to climb (N-1) steps + (N-2) steps. It's Fibonacci sequence.
+
+
+![][fig]
+
+[fig]:./fig/fig1.png
+
diff --git a/2021-08/2021-08-26 (day39)/Tim/fig/fig1.png b/2021-08/2021-08-26 (day39)/Tim/fig/fig1.png
diff --git a/2021-08/2021-08-26 (day39)/Tim/solution.py b/2021-08/2021-08-26 (day39)/Tim/solution.py
@@ -0,0 +1,11 @@
+class Solution:
+    def climbStairs(self, n: int) -> int:
+
+        prev = 0
+        cur = 1
+        for i in range(n):
+            tmp = cur
+            cur = prev+cur
+            prev = tmp
+        return cur
+