leetcode

leetcode/70.py

@@ -0,0 +1,8 @@
+class Solution:
+    def climbStairs(self, n: int) -> int:
+        dp=[0,1,2]
+
+        for i in range(3,n+1):
+            dp.append(dp[i-2]+dp[i-1])
+        
+        return dp[n]