733. Flood Fill

733. Flood Fill

问题描述：
An image is 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 value newColor, “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.
Example 1:

Input: 
image = [[1,1,1],[1,1,0],[1,0,1]]
sr = 1, sc = 1, newColor = 2
Output: [[2,2,2],[2,2,0],[2,0,1]]
Explanation: 
From the center of the image (with position (sr, sc) = (1, 1)), all pixels connected 
by a path of the same color as the starting pixel are colored with the new color.
Note the bottom corner is not colored 2, because it is not 4-directionally connected
to the starting pixel.

分析：一个简单的搜索问题，将输入的点附近能到达的所有的点的value替换为newColor。使用深搜。
要注意的是本题搜索的条件是：在初始点4个方向上的同颜色的点才访问，不同颜色的不访问。

class Solution {
public:
    int v[50][50]={0};
    int scolor=0;
    vector<vector<int>> floodFill(vector<vector<int>>& image, int sr, int sc, int newColor) {
        scolor = image[sr][sc];
        dfs(image,sr,sc,newColor);
            return image;
    }
    void dfs(vector<vector<int>>& image,int sr,int sc,int newColor){
        if(sr<0||sr>=image.size()||sc<0||sc>=image[0].size()||image[sr][sc]!=scolor)return ;//超过边//界 value为0
        if(v[sr][sc]==1)return;//已经换色
        v[sr][sc]=1;
        //cout<<sr<<" "<<sc<<endl;
        if(image[sr][sc]==scolor)
        image[sr][sc]=newColor;//换色
        dfs(image,sr+1,sc,newColor);
        dfs(image,sr,sc+1,newColor);
        dfs(image,sr-1,sc,newColor);
        dfs(image,sr,sc-1,newColor);
    }
};