🎨 Climbing Stairs Solution

Author: lwy-0418

climbing-stairs/dalpang81.java

@@ -0,0 +1,19 @@
+/*
+시간복잡도 : O(n)
+ 공간복잡도 : O(n)
+ */
+class Solution {
+    public int climbStairs(int n) {
+        if (n <= 2) return n;
+
+        int[] dp = new int[n + 1];
+        dp[1] = 1;
+        dp[2] = 2;
+
+        for(int i = 3; i <= n; i++)
+            dp[i] = dp[i - 1] + dp[i - 2];
+
+        return dp[n];
+
+    }
+}