JAVA_Flood Fill_LeetCode 733

JAVA_Flood Fill_LeetCode 733 풀이 class Solution { public int[][] floodFill(int[][] image, int sr, int sc, int color) { if (image[sr][sc] != color) dfs(image, sr, sc, image[sr][sc], color); return image; } private void dfs(int[][] image, int i, int j, int color1, int color2) { if (i < 0 || j < 0 || i >= image.length || j >= image[0].length || image[i][j] != color1) return; image[i][j] = color2; dfs(image, i, j - 1, color1, color2); dfs(image, i, j + 1, color1, color2); dfs(image, i - 1, j, color1,...

원문링크 : JAVA_Flood Fill_LeetCode 733