[10월 2주차] naekang_algorithm

naekang/sorting/src/boj10815.java

@@ -0,0 +1,57 @@
+import java.io.BufferedReader;
+import java.io.IOException;
+import java.io.InputStreamReader;
+import java.lang.reflect.Array;
+import java.util.Arrays;
+import java.util.StringTokenizer;
+
+public class boj10815 {
+
+    static int N, M;
+    static int[] arr;
+
+    public static void main(String[] args) throws IOException {
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+
+        N = Integer.parseInt(br.readLine());
+        arr = new int[N];
+        StringTokenizer st = new StringTokenizer(br.readLine());
+        for (int i = 0; i < N; i++) {
+            arr[i] = Integer.parseInt(st.nextToken());
+        }
+        Arrays.sort(arr);
+
+        M = Integer.parseInt(br.readLine());
+        st = new StringTokenizer(br.readLine());
+
+        for (int i = 0; i < M; i++) {
+            int num = Integer.parseInt(st.nextToken());
+
+            if (search(num)) {
+                System.out.print("1 ");
+            } else {
+                System.out.print("0 ");
+            }
+        }
+
+    }
+
+    static boolean search(int x) {
+        int left = 0;
+        int right = N - 1;
+
+        while (left <= right) {
+            int midInx = (left + right) / 2;
+            int mid = arr[midInx];
+
+            if (x < mid) {
+                right = midInx - 1;
+            } else if (x > mid) {
+                left = midInx + 1;
+            } else {
+                return true;
+            }
+        }
+        return false;
+    }
+}

naekang/sorting/src/boj11652.java

@@ -0,0 +1,36 @@
+import java.io.BufferedReader;
+import java.io.IOException;
+import java.io.InputStreamReader;
+import java.util.Arrays;
+
+public class boj11652 {
+    public static void main(String[] args) throws IOException {
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+
+        int N = Integer.parseInt(br.readLine());
+        long[] arr = new long[N];
+
+        for (int i = 0; i < N; i++) {
+            arr[i] = Long.parseLong(br.readLine());
+        }
+
+        Arrays.sort(arr);
+
+        long num = arr[0];
+        int cnt = 1;
+        int max = 1;
+
+        for (int i = 1; i < N; i++) {
+            if (arr[i] == arr[i - 1]) {
+                cnt++;
+            } else {
+                cnt = 1;
+            }
+            if (cnt > max) {
+                max = cnt;
+                num = arr[i];
+            }
+        }
+        System.out.println(num);
+    }
+}

naekang/sorting/src/boj2752.java

@@ -0,0 +1,23 @@
+import java.io.BufferedReader;
+import java.io.IOException;
+import java.io.InputStreamReader;
+import java.util.Arrays;
+import java.util.StringTokenizer;
+
+public class boj2752 {
+    public static void main(String[] args) throws IOException {
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+        StringTokenizer st = new StringTokenizer(br.readLine());
+        int[] arr = new int[3];
+
+        for (int i = 0; i < arr.length; i++) {
+            arr[i] = Integer.parseInt(st.nextToken());
+        }
+
+        Arrays.sort(arr);
+
+        for (int i = 0; i < 3; i++) {
+            System.out.print(arr[i] + " ");
+        }
+    }
+}