Merge pull request #61 from Jsumin07/feat/baekjoon

feat (Soomin): add/week8-Baekjoon_1260.java,Baekjoon_2178.java

Author: Jsumin07

Soomin/week8/Beakjoon_1260.java

@@ -0,0 +1,74 @@
+package week8;
+
+import java.io.*;
+import java.util.*;
+
+public class Beakjoon_1260 {
+    static int N, M, V;
+    static ArrayList<Integer>[] graph;
+    static boolean[] visited;
+
+    public static void main(String[] args) throws IOException {
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+        StringTokenizer st = new StringTokenizer(br.readLine());
+
+        N = Integer.parseInt(st.nextToken());
+        M = Integer.parseInt(st.nextToken());
+        V = Integer.parseInt(st.nextToken());
+
+        graph = new ArrayList[N + 1];
+        for (int i = 1; i <= N; i++) {
+            graph[i] = new ArrayList<>();
+        }
+
+        for (int i = 0; i < M; i++) {
+            st = new StringTokenizer(br.readLine());
+            int a = Integer.parseInt(st.nextToken());
+            int b = Integer.parseInt(st.nextToken());
+            graph[a].add(b);
+            graph[b].add(a);
+        }
+
+
+        for (int i = 1; i <= N; i++) {
+            Collections.sort(graph[i]);
+        }
+
+        visited = new boolean[N + 1];
+        dfs(V);
+        System.out.println();
+
+        visited = new boolean[N + 1];
+        bfs(V);
+        System.out.println();
+    }
+
+
+    static void dfs(int node) {
+        visited[node] = true;
+        System.out.print(node + " ");
+        for (int next : graph[node]) {
+            if (!visited[next]) {
+                dfs(next);
+            }
+        }
+    }
+
+
+    static void bfs(int start) {
+        Queue<Integer> queue = new LinkedList<>();
+        visited[start] = true;
+        queue.offer(start);
+
+        while (!queue.isEmpty()) {
+            int cur = queue.poll();
+            System.out.print(cur + " ");
+            for (int next : graph[cur]) {
+                if (!visited[next]) {
+                    visited[next] = true;
+                    queue.offer(next);
+                }
+            }
+        }
+    }
+}

Soomin/week8/Beakjoon_2178.java

@@ -0,0 +1,66 @@
+package week8;
+
+import java.io.*;
+import java.util.*;
+
+public class Beakjoon_2178 {
+    static int N, M;
+    static int[][] maze;
+    static boolean[][] visited;
+
+
+    static int[] dRow = { -1, 1, 0, 0 };
+    static int[] dCol = { 0, 0, -1, 1 };
+
+    public static void main(String[] args) throws IOException {
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+        StringTokenizer st = new StringTokenizer(br.readLine());
+
+        N = Integer.parseInt(st.nextToken());
+        M = Integer.parseInt(st.nextToken());
+
+        maze = new int[N][M];
+        visited = new boolean[N][M];
+
+        for (int i = 0; i < N; i++) {
+            String line = br.readLine();
+            for (int j = 0; j < M; j++) {
+                maze[i][j] = line.charAt(j) - '0';
+            }
+        }
+
+        int result = bfs(0, 0);
+        System.out.println(result);
+    }
+
+    static int bfs(int sr, int sc) {
+        Queue<int[]> queue = new LinkedList<>();
+        queue.offer(new int[] { sr, sc });
+        visited[sr][sc] = true;
+
+        while (!queue.isEmpty()) {
+            int[] cur = queue.poll();
+            int r = cur[0];
+            int c = cur[1];
+
+
+            if (r == N - 1 && c == M - 1) {
+                return maze[r][c];
+            }
+
+            for (int d = 0; d < 4; d++) {
+                int nr = r + dRow[d];
+                int nc = c + dCol[d];
+
+                if (nr < 0 || nr >= N || nc < 0 || nc >= M) continue;
+                if (visited[nr][nc] || maze[nr][nc] == 0) continue;
+
+                visited[nr][nc] = true;
+                maze[nr][nc] = maze[r][c] + 1;
+                queue.offer(new int[] { nr, nc });
+            }
+        }
+
+        return -1;
+    }
+}