solve: https://cote.inflearn.com/contest/10/problem/10-01

showpointer · showpointer · commit 1d9959c5a894 · 2021-10-03T13:32:42.000+09:00
diff --git a/java/inflearn/problemsolving/P10_01_계단오르기.java b/java/inflearn/problemsolving/P10_01_계단오르기.java
@@ -0,0 +1,28 @@
+// https://cote.inflearn.com/contest/10/problem/10-01
+package inflearn.problemsolving;
+
+import java.util.Scanner;
+
+public class P10_01_계단오르기 {
+
+    static int[] dy;
+
+    public static int solve(int n) {
+        int answer = 0;
+        dy[1] = 1;
+        dy[2] = 2;
+        for (int i =3; i <= n; i++) {
+            dy[i] = dy[i-2] + dy[i-1];
+        }
+        answer = dy[n];
+        return answer;
+    }
+
+    public static void main(String[] args) {
+        // 7 => 21
+        Scanner in = new Scanner(System.in);
+        int n = in.nextInt();
+        dy = new int[n+1];
+        System.out.println(solve(n));
+    }
+}
