1주차 : 배열 문제 풀이

Author: seyeon22222

Array/11328-Strfry.java

@@ -0,0 +1,42 @@
+import java.io.*;
+import java.util.*;
+
+public class Main {
+
+    public static boolean check(String a, String b) {
+        if (a.length() != b.length())
+            return false;
+
+        int[] count = new int[26];
+
+        for (int i = 0; i < a.length(); ++i) {
+            count[a.charAt(i) - 'a']++;
+            count[b.charAt(i) - 'a']--;
+        }
+
+        for (int c : count) {
+            if (c != 0) {
+                return false;
+            }
+        }
+        return true;
+    }
+
+
+    public static void main(String[] args) throws Exception {
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+
+        int n = Integer.parseInt(br.readLine());
+
+        for (int i = 0; i < n; ++i) {
+            String[] str = br.readLine().split(" ");
+            String a = str[0];
+            String b = str[1];
+            if (check(a,b)) {
+                System.out.println("Possible");
+            } else {
+                System.out.println("Impossible");
+            }
+        }
+    }
+}

Array/13300-방배정.java

@@ -0,0 +1,34 @@
+import java.io.*;
+import java.util.*;
+
+public class Main {
+
+    public static void main(String[] args) throws Exception {
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+
+        String[] input = br.readLine().split(" ");
+        int n = Integer.parseInt(input[0]);
+        int k = Integer.parseInt(input[1]);
+
+        Map<Integer, Integer> s = new HashMap<>();
+        Map<Integer, Integer> f = new HashMap<>();
+
+        for (int i = 0; i < n; ++i) {
+            input = br.readLine().split(" ");
+            int b = Integer.parseInt(input[0]);
+            int a = Integer.parseInt(input[1]);
+            if (b == 0) {
+                s.put(a, s.getOrDefault(a, 0) + 1);
+            } else {
+                f.put(a, f.getOrDefault(a, 0) + 1);
+            }
+        }
+        int ans = 0;
+        for (Map<Integer, Integer> map : List.of(s, f)) {
+            for (int count : map.values()) {
+                ans += (count + k - 1) / k;
+            }
+        }
+        System.out.println(ans);
+    }
+}

Array/1919-에너그램만들기.java

@@ -0,0 +1,26 @@
+import java.io.*;
+import java.util.*;
+
+public class Main {
+
+    public static void main(String[] args) throws Exception {
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+
+        String input1 = br.readLine();
+        String input2 = br.readLine();
+
+        int[] arr = new int[26];
+        for (int i = 0; i < input1.length(); ++i) {
+            arr[input1.charAt(i) - 'a']++;
+        }
+        for (int i = 0; i < input2.length(); ++i) {
+            arr[input2.charAt(i) - 'a']--;
+        }
+
+        int ans = 0;
+        for (int i = 0; i < 26; ++i) {
+            ans += Math.abs(arr[i]);
+        }
+        System.out.println(ans);
+    }
+}