[JAVA] 알고리즘 : DFS, BFS- 섬나라 아일랜드
DFS import java.util.Scanner; public class Main{ static int n, answer=0; static int[] dx = {-1, -1, 0, 1, 1, 1, 0, -1}; static int[] dy = {0, 1, 1, 1, 0, -1, -1, -1}; public void DFS(int x, int y, int[][] board){ for(int i=0; i=0 && nx=0 && ny