0915

Author: choifi

leetcode3/최민지/357.py

@@ -0,0 +1,6 @@
+class Solution:
+    def countNumbersWithUniqueDigits(self, n: int) -> int:
+        if n == 0:
+            return 1
+        else:
+            return (10 ** n) - (9 * n)

leetcode3/최민지/70.py

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