[Week01] BOJ 2750: 수 정렬하기

Author: JAEHEE25

weekly/week01/BOJ_10828_스택/JAEHEE25.java

@@ -0,0 +1,68 @@
+package stduy.week01;
+
+import java.io.BufferedReader;
+import java.io.IOException;
+import java.io.InputStreamReader;
+import java.util.StringTokenizer;
+
+class BOJ10828 {
+	static int[] stack = new int[10001];
+	static int size;
+	public static void main(String[] args) throws IOException {
+		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+		int N = Integer.parseInt(br.readLine());
+		StringBuilder sb = new StringBuilder();
+		
+		for(int i = 0; i < N; i++) {
+			StringTokenizer st = new StringTokenizer(br.readLine());
+			String input = st.nextToken();
+			
+			switch (input) {
+			    case "push" :
+				    push(Integer.parseInt(st.nextToken()));
+				    break;
+			    case "pop" :
+				    sb.append(pop()).append("\n");
+				    break;
+			    case "size" :
+				    sb.append(size()).append("\n");
+				    break;
+			    case "empty" :
+				    sb.append(empty()).append("\n");
+				    break;
+			    case "top" :
+				    sb.append(top()).append("\n");
+				    break;
+			}
+		}
+		System.out.println(sb);
+	}
+	
+	public static void push(int num) {
+		stack[size++] = num;
+	}
+	
+	public static int pop() {
+		if (size == 0) return -1;
+		else {
+			int pop = stack[size - 1];
+			size--;
+			return pop;
+		}
+	}
+	
+	public static int size() {
+		return size;
+	}
+	
+	public static int empty() {
+		if (size == 0) return 1;
+		return 0;
+	}
+	
+	public static int top() {
+		if (size == 0) return -1;
+		return stack[size - 1];
+	}
+
+}

weekly/week01/BOJ_1920_수 찾기/JAEHEE25.java

@@ -0,0 +1,33 @@
+package stduy.week01;
+
+import java.io.*;
+import java.util.*;
+
+class BOJ1920 {
+    public static void main(String[] args) throws IOException {
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+        int n = Integer.parseInt(br.readLine());
+        int[] arr = new int[n];
+        StringTokenizer st = new StringTokenizer(br.readLine());
+        for (int i = 0; i < n; i++) {
+            arr[i] = Integer.parseInt(st.nextToken());
+        }
+        int m = Integer.parseInt(br.readLine());
+
+        Arrays.sort(arr);
+
+        StringBuilder sb = new StringBuilder();
+        st = new StringTokenizer(br.readLine());
+        for (int i = 0; i < m; i++) {
+            int num = Integer.parseInt(st.nextToken());
+            int in = Arrays.binarySearch(arr, num);
+
+            if (in < 0) {
+                sb.append(0 + "\n");
+            } else {
+                sb.append(1 + "\n");
+            }
+        }
+        System.out.println(sb);
+    }
+}

weekly/week01/BOJ_2750_수 정렬하기/JAEHEE25.java

@@ -4,7 +4,7 @@
 import java.lang.*;
 import java.io.*;
 
-class Main {
+class BOJ2750 {
     public static void main(String[] args) throws IOException {
         BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
         int N = Integer.parseInt(br.readLine());