[PGS] 지게차와_크레인

Programmers/Gayo/지게차와_크레인.java

@@ -0,0 +1,87 @@
+import java.util.*;
+
+class Solution {
+    public int solution(String[] storage, String[] requests) {
+        int answer = 0;
+
+        int n = storage.length;
+        int m = storage[0].length();
+
+        char[][] grid = new char[n+2][m+2];
+        for(int i=0; i<n+2; i++){
+            Arrays.fill(grid[i], '.');
+        }
+
+        for(int i=0; i<n; i++){
+            for(int j=0; j<m; j++){
+                grid[i+1][j+1] = storage[i].charAt(j);
+            }
+        }
+
+        for(String r : requests){
+            char target = r.charAt(0);
+            if(r.length()==1){
+                removeBfs(grid, target, n, m);
+            } else {
+                removeCrane(grid, target, n, m);
+            }
+
+        }
+
+        for(int i=1; i<=n; i++){
+            for(int j=1; j<=m; j++){
+                if(grid[i][j] != '.'){
+                    answer++;
+                }
+            }
+        }      
+        return answer;
+    }
+
+    public void removeBfs(char[][] grid, char target, int n, int m){
+        int[] dr = {-1, 1, 0, 0};
+        int[] dc = {0, 0, -1, 1};
+
+        boolean[][] visited = new boolean[n+2][m+2];
+        Queue<int[]> queue = new LinkedList<>();
+        List<int[]> toRemove = new ArrayList<>();
+
+        queue.offer(new int[]{0, 0});
+        visited[0][0] = true;
+
+        while (!queue.isEmpty()) {
+            int[] curr = queue.poll();
+            int r = curr[0];
+            int c = curr[1];
+
+            for (int d = 0; d < 4; d++) {
+                int nr = r + dr[d];
+                int nc = c + dc[d];
+
+                if (nr >= 0 && nr < n + 2 && nc >= 0 && nc < m + 2 && !visited[nr][nc]) {
+                    if (grid[nr][nc] == '.') {
+                        visited[nr][nc] = true;
+                        queue.offer(new int[]{nr, nc});
+                    } else if (grid[nr][nc] == target) {
+                        visited[nr][nc] = true;
+                        toRemove.add(new int[]{nr, nc});
+                    }
+                }
+            }
+        }
+
+        for (int[] pos : toRemove) {
+            grid[pos[0]][pos[1]] = '.';
+        }
+    }
+
+    private void removeCrane(char[][] grid, char target, int n, int m) {
+        for (int i=1; i<=n; i++) {
+            for (int j=1; j<=m; j++) {
+                if (grid[i][j]==target) {
+                    grid[i][j]='.';
+                }
+            }
+        }
+    }
+}