본문 바로가기

bfs6

백준 14503 변형 bfs문제 -java 소스코드 package baekjoon; import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.StringTokenizer; public class Baek14503 { //북 동 남 서 static int[] dx = {-1, 0, 1, 0}; static int[] dy = {0, 1, 0, -1}; static int n, m, row, col, seeDir; static int[][] map; static int clean = 1; public static void main(String[] args) throws IOException { BufferedRe.. 2023. 12. 2.
백준 알고리즘 2644 DFS & BFS -java 출처 : https://www.acmicpc.net/problem/2644 소스코드 package baekjoon; import java.io.*; import java.util.*; public class Baek2644 { static int n, m; static int start, end; static int [] distance; static boolean [] visited; static List graph = new ArrayList(); public static void main(String[] args) throws IOException { //입력받기 BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); n .. 2023. 12. 2.
프로그래머스 가장 먼 노드 bfs문제 -java 출처: https://school.programmers.co.kr/learn/courses/30/lessons/49189 소스코드 import java.util.*; class Solution { List graph; int [] distance; boolean [] visited; public int solution(int n, int[][] edge) { int cnt =0; graph = new ArrayList(n+1); distance = new int[n+1]; visited = new boolean[n+1]; for(int i = 0; i 2023. 12. 2.
백준 2583 영역구하기 (dfs & bfs) 출처: https://www.acmicpc.net/problem/2583 소스코드 package baekjoon; import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.*; public class Baek2583 { static int m, n, k; static int[][] canGo = {{0, 1}, {0, -1}, {-1, 0}, {1, 0}}; static int [][] map; static List sectionSizes = new ArrayList(); public static void main(String[] args) throws IOExcep.. 2023. 12. 2.

티스토리툴바