[0713] 1874 스택 수열

src/main/java/Main.java

@@ -5,44 +5,38 @@ public class Main{
 
     public static void main(String[] args)throws IOException{
         BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+        StringTokenizer tokens = new StringTokenizer(br.readLine(), ",");
+        ArrayList<Object> ls = new ArrayList<>();
+        while (tokens.hasMoreTokens()) {
+           ls.add(Integer.parseInt(tokens.nextToken()));
+        }
+        int[] array = new int[ls.size()];
+        for (int i = 0; i < ls.size(); i++) {
+            array[i] = (int)ls.get(i);
+        }
 
-        int N =Integer.valueOf(br.readLine());
-        String[] results = new String[N];
-
-        for(int i=0;i<N;i++)
-        {
-            StringTokenizer tokens = new StringTokenizer(br.readLine(), " ");
-            String s1 = tokens.nextToken();
-            String s2 = tokens.nextToken();
-
-            char[] carr1 = s1.toCharArray();
-            char[] carr2 = s2.toCharArray();
-
-            Arrays.sort(carr2);
-            Arrays.sort(carr1);
 
-            // case1: diff length
-            if(carr1.length!=carr2.length) results[i] = "Impossible";
+    }
+    public static int[] solution(int[] array, int[][] commands) {
 
-            // case2: same length
-            boolean flag = true;
+        int[] results=new int[commands.length];
+        for(int a=0;a<commands.length;a++)
+        {
+            int i,j,k;
+            i=commands[a][0];
+            j=commands[a][1];
+            k=commands[a][2];
 
-            // validate same character or not
-            for (int j = 0; j < carr1.length; j++) {
-                if (carr1[j] != carr2[j]) {
-                    results[i] = "Impossible";
-                    flag = false;
-                    break;
-                }
-            }
+            int[] cArray=new int[array.length-(j-i+1)];
+            System.arraycopy(array,0,cArray,0,i);
+            System.arraycopy(array,j,cArray,i,array.length-j);
 
-            if(flag) results[i] = "Possible";
+            Arrays.sort(cArray);
 
+            results[a]=cArray[k-1];
         }
 
-
-
-        for(String result:results) System.out.println(result);
-
+        int[] answer = results;
+        return answer;
     }
 }

src/main/java/Problem11328.java

@@ -8,6 +8,7 @@ public class Problem11328 {
 
     public static void main(String[] args)throws IOException{
         BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+        StringBuilder sb=new StringBuilder();
 
         int N =Integer.valueOf(br.readLine());
         String[] results = new String[N];
@@ -25,27 +26,27 @@ public static void main(String[] args)throws IOException{
             Arrays.sort(carr1);
 
             // case1: diff length
-            if(carr1.length!=carr2.length) results[i] = "Impossible";
+            if (carr1.length != carr2.length) {
+                sb.append("Impossible\n");
+                continue;
+            }
 
             // case2: same length
             boolean flag = true;
 
             // validate same character or not
             for (int j = 0; j < carr1.length; j++) {
                 if (carr1[j] != carr2[j]) {
-                    results[i] = "Impossible";
+                    sb.append("Impossible\n");
                     flag = false;
                     break;
                 }
             }
 
-            if(flag) results[i] = "Possible";
+            if(flag) sb.append("Possible\n");
 
         }
 
-
-
-        for(String result:results) System.out.println(result);
-
+        System.out.println(sb);
     }
 }

src/main/java/Problem1158Re.java

@@ -0,0 +1,43 @@
+import java.io.BufferedReader;
+import java.io.IOException;
+import java.io.InputStreamReader;
+import java.util.*;
+
+public class Problem1158Re {
+
+    public static void main(String[] args)throws IOException {
+        BufferedReader br = new BufferedReader(new InputStreamReader((System.in)));
+        StringTokenizer tokens = new StringTokenizer(br.readLine(), " ");
+        StringBuilder sb=new StringBuilder();
+
+        int N = Integer.valueOf(tokens.nextToken());
+        int M = Integer.valueOf(tokens.nextToken());
+        Deque<Integer> q = new ArrayDeque<>();
+        for(int i=0;i<N;i++)
+        {
+            q.offer(i+1);
+        }
+
+        //when
+        int ptr = M - 1;
+        List<Integer> result = new LinkedList<>();
+        sb.append("<");
+        while (!q.isEmpty()) {
+            for (int i = 1; i <= M - 1; i++) {
+                q.offer(q.poll());
+            }
+            result.add(q.poll());
+        }
+
+
+        for (Integer num : result) {
+            if (num == result.get(N - 1)) {
+                sb.append(num + ">");
+            } else {
+                sb.append(num + ", ");
+            }
+        }
+
+        System.out.println(sb);
+    }
+}

src/main/java/Problem1874.java

@@ -0,0 +1,37 @@
+import java.util.Scanner;
+import java.util.Stack;
+
+public class Problem1874 {
+    // asc
+    public static void main(String[] args) {
+        Scanner sc = new Scanner(System.in);
+        StringBuilder sb = new StringBuilder();
+        Stack<Integer> stack = new Stack<>();
+        int N = sc.nextInt();
+
+        int max = 0;
+        int prev = -1;
+        for (int i = 0; i < N; i++) {
+            int target = sc.nextInt();
+
+            if (target > max) {
+                for (int j = max + 1; j <= target; j++) {
+                    stack.push(j);
+                    sb.append("+\n");
+                }
+                max = target;
+            }
+
+            if (stack.peek() != target) {
+                System.out.println("NO");
+                return;
+            }
+
+            stack.pop();
+            sb.append("-\n");
+        }
+
+        System.out.println(sb);
+
+    }
+}