feat: 예제 12번문제

src/main/java/com/doit/algorithm/kdg/Main.java

@@ -0,0 +1,49 @@
+package com.doit.algorithm.kdg;
+
+import java.util.ArrayList;
+import java.util.List;
+import java.util.Scanner;
+import java.util.stream.Collectors;
+
+public class Main {
+
+    public static void main(String[] args) {
+        Scanner in = new Scanner(System.in);
+
+        int n = in.nextInt();
+        String s = "";
+
+        for (int i = 0; i < n; i++) {
+            s += in.nextInt() + " ";
+        }
+
+        String result = solution(n, s);
+
+        System.out.println(result);
+    }
+
+    public static String solution(int n, String s) {
+        List<Integer> result = new ArrayList<>();
+        int[] numbers = new int[n];
+
+        String[] split = s.split(" ");
+        for (int i = 0; i < split.length; i++) {
+            numbers[i] = Integer.parseInt(split[i]);
+        }
+
+        for (int i = 0; i < n; i++) {
+            int max = 0;
+            for (int j = n -1; j > i; j--) {
+                if (numbers[i] < numbers[j]) {
+                    max = numbers[j];
+                }
+            }
+            if (max == 0 ) result.add(-1);
+            else result.add(max);
+        }
+
+        return result.stream()
+                .map(String::valueOf)
+                .collect(Collectors.joining(" "));
+    }
+}

src/main/java/com/doit/algorithm/kdg/Problem012.java

@@ -0,0 +1,33 @@
+package com.doit.algorithm.kdg;
+
+import java.util.ArrayList;
+import java.util.List;
+import java.util.stream.Collectors;
+
+public class Problem012 {
+
+    public static String solution(int n, String s) {
+        List<Integer> result = new ArrayList<>();
+        int[] numbers = new int[n];
+
+        String[] split = s.split(" ");
+        for (int i = 0; i < split.length; i++) {
+            numbers[i] = Integer.parseInt(split[i]);
+        }
+
+        for (int i = 0; i < n; i++) {
+            int max = 0;
+            for (int j = n -1; j > i; j--) {
+                if (numbers[i] < numbers[j]) {
+                    max = numbers[j];
+                }
+            }
+            if (max == 0 ) result.add(-1);
+            else result.add(max);
+        }
+
+        return result.stream()
+                .map(String::valueOf)
+                .collect(Collectors.joining(" "));
+    }
+}

src/test/java/com/doit/algorithm/kdg/Problem012Test.java

@@ -0,0 +1,28 @@
+package com.doit.algorithm.kdg;
+
+import org.junit.jupiter.api.Test;
+
+import static org.assertj.core.api.Assertions.assertThat;
+
+public class Problem012Test {
+
+    @Test
+    void solution_1() {
+        int n = 4;
+        String s = "3 5 2 7";
+
+        String result = Problem012.solution(n, s);
+
+        assertThat(result).isEqualTo("5 7 7 -1");
+    }
+    @Test
+    void solution_2() {
+        int n = 4;
+        String s = "9 5 4 8";
+
+        String result = Problem012.solution(n, s);
+
+        assertThat(result).isEqualTo("-1 8 8 -1");
+    }
+
+}