解题思路:
(1)使用map记录已访问的坐标,使用递归依次访问周围的领接点
class Solution {
private:
unordered_map<int,vector<int>> mp;
vector<int>::iterator it;
unordered_map<int,vector<int>>::iterator m;
public:
void visited(vector<vector<int>>& image,int x,int y) {
it = find(mp[x].begin(),mp[x].end(),y);
if(it==mp[x].end()) {
mp[x].push_back(y);
if(x-1>=0 && image[x-1][y]==image[x][y]) visited(image,x-1,y);
if(x+1<image.size() && image[x+1][y]==image[x][y]) visited(image,x+1,y);
if(y-1>=0 && image[x][y-1]==image[x][y]) visited(image,x,y-1);
if(y+1<image[x].size() && image[x][y+1]==image[x][y]) visited(image,x,y+1);
}
}
vector<vector<int>> floodFill(vector<vector<int>>& image, int sr, int sc, int newColor) {
visited(image,sr,sc);
for(m=mp.begin();m!=mp.end();m++) {
for(it=mp[m->first].begin();it!=mp[m->first].end();it++) {
image[m->first][*it]=newColor;
}
}
return image;
}
};