Animageis represented by a 2-D array of integers, each integer representing the pixel value of the image (from 0 to 65535).

Given a coordinate(sr, sc)representing the starting pixel (row and column) of the flood fill, and a pixel valuenewColor, "flood fill" the image.

To perform a "flood fill", consider the starting pixel, plus any pixels connected 4-directionally to the starting pixel of the same color as the starting pixel, plus any pixels connected 4-directionally to those pixels (also with the same color as the starting pixel), and so on. Replace the color of all of the aforementioned pixels with the newColor.

At the end, return the modified image.

Note:

The length ofimageandimage[0]will be in the range[1, 50].

The given starting pixel will satisfy0 <= sr < image.lengthand0 <= sc < image[0].length.

The value of each color inimage[i][j]andnewColorwill be an integer in[0, 65535]

.

class Solution {
    public int[][] floodFill(int[][] image, int sr, int sc, int newColor) {
        if(image[sr][sc] == newColor)
            return image;
        dfs(image, sr, sc, image[sr][sc], newColor);

        return image;
    }

    public void dfs(int[][] image, int sr, int sc, int oldColor, int newColor) {
        int m = image.length;
        int n = image[0].length;

        if(sr == m || sr < 0 || sc == n || sc < 0)
            return;

        if(image[sr][sc] != oldColor)
            return;

        image[sr][sc] = newColor;
        dfs(image, sr - 1, sc, oldColor, newColor);
        dfs(image, sr + 1, sc, oldColor, newColor);
        dfs(image, sr, sc - 1, oldColor, newColor);
        dfs(image, sr, sc + 1, oldColor, newColor);
    }
}