Merge branch 'week14'

Author: spring0913

Diff for: week14/BOJ_1987(알파벳).java

@@ -0,0 +1,53 @@
+import java.io.*;
+import java.util.*;
+
+public class Main {
+
+    private static int R, C;
+    private static char[][] board;
+    private static boolean[][] visited;
+    private static boolean[] check;
+    private static int[] dh = {-1, 0, 1, 0};
+    private static int[] dw = {0, 1, 0, -1};
+    private static int answer = 0;
+
+    public static void main(String[] args) throws IOException {
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+        StringTokenizer st = new StringTokenizer(br.readLine());
+        R = Integer.parseInt(st.nextToken());
+        C = Integer.parseInt(st.nextToken());
+        board = new char[R][C];
+        visited = new boolean[R][C];
+        check = new boolean[30];
+        for(int i=0; i<R; i++) {
+            String input = br.readLine();
+            for(int j=0; j<C; j++) {
+                board[i][j] = input.charAt(j);
+            }
+        }
+        visited[0][0] = true;
+        check[board[0][0] - 'A'] = true;
+        dfs(0, 0, 1);
+        System.out.println(answer);
+    }
+
+    public static void dfs(int h, int w, int depth) {
+        if(depth > R*C) {
+            return;
+        }
+        answer = Math.max(answer, depth);
+
+        for(int i=0; i<4; i++) {
+            int nextH = h + dh[i];
+            int nextW = w + dw[i];
+            if(nextH >= 0 && nextH < R && nextW >=0 && nextW < C) {
+                int index = board[nextH][nextW] - 'A';
+                if(!visited[nextH][nextW] & !check[index]) {
+                    check[index] = true;
+                    dfs(nextH, nextW, depth+1);
+                    check[index] = false;
+                }
+            }
+        }
+    }
+}

Diff for: week14/BOJ_19951(태상이의 훈련소 생활).java

@@ -0,0 +1,35 @@
+import java.io.*;
+import java.util.*;
+
+public class Main {
+
+    public static void main(String[] args) throws IOException {
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+        StringTokenizer st = new StringTokenizer(br.readLine());
+        int N = Integer.parseInt(st.nextToken());
+        int M = Integer.parseInt(st.nextToken());
+        int[] h = new int[N+1];
+        st = new StringTokenizer(br.readLine());
+        for(int i=1; i<=N; i++) {
+            h[i] = Integer.parseInt(st.nextToken());
+        }
+        int[] arr = new int[N+2];
+        for(int i=0; i<M; i++) {
+            st = new StringTokenizer(br.readLine());
+            int a = Integer.parseInt(st.nextToken());
+            int b = Integer.parseInt(st.nextToken());
+            int k = Integer.parseInt(st.nextToken());
+            arr[a] += k;
+            arr[b+1] -= k;
+        }
+        for(int i=1; i<=N; i++) {
+            arr[i] += arr[i-1];
+            h[i] += arr[i];
+        }
+        StringBuilder sb = new StringBuilder();
+        for(int i=1; i<=N; i++) {
+            sb.append(h[i]).append(' ');
+        }
+        System.out.println(sb);
+    }
+}

Diff for: week14/BOJ_5052(전화번호 목록).java

@@ -0,0 +1,30 @@
+import java.io.*;
+import java.util.*;
+
+public class Main {
+
+    public static void main(String[] args) throws IOException {
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+        int t = Integer.parseInt(br.readLine());
+        StringBuilder sb = new StringBuilder();
+        while(t-- > 0) {
+            int n = Integer.parseInt(br.readLine());
+            String[] str = new String[n];
+            for(int i=0; i<n; i++) {
+                str[i] = br.readLine();
+            }
+            Arrays.sort(str);
+            sb.append(check(str) ? "YES" : "NO").append('\n');
+        }
+        System.out.print(sb);
+    }
+
+    public static boolean check(String[] str) {
+        for(int i=1; i<str.length; i++) {
+            if(str[i].startsWith(str[i-1])) {
+                return false;
+            }
+        }
+        return true;
+    }
+}

Diff for: week14/Programmers_142085(디펜스 게임).java

@@ -0,0 +1,23 @@
+import java.util.*;
+
+class Solution {
+    public int solution(int n, int k, int[] enemy) {
+        int round = 0;
+        PriorityQueue<Integer> pq = new PriorityQueue<>();
+        for(int i=0; i<enemy.length; i++) {
+            round = i+1;
+            pq.offer(enemy[i]);
+            if(k-- > 0) {
+                continue;
+            }
+            int knight = pq.poll();
+            if(n - knight >= 0) {
+                n -= knight;
+            }else {
+                round--;
+                break;
+            }
+        }
+        return round;
+    }
+}