码迷,mamicode.com
首页 > 其他好文 > 详细

[LeetCode] Flood Fill

时间:2017-12-01 11:34:10      阅读:104      评论:0      收藏:0      [点我收藏+]

标签:递归   nbsp   cto   ace   bsp   form   osi   void   rip   

 

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.

Note:

  • The length of image and image[0] will be in the range [1, 50].
  • The given starting pixel will satisfy 0 <= sr < image.length and 0 <= sc < image[0].length.
  • The value of each color in image[i][j] and newColor will be an integer in [0, 65535].

给定一个二维矩阵、一个坐标值以及一个新的颜色值,判断二维矩阵中给定坐标点的值与新的颜色值是否相等,如果相等返回原二维矩阵,如果不等将与给定坐标点值相连的相同颜色值都改变为新的颜色值。

思路:递归的对给定坐标周围的值进行循环判断。

class Solution {
public:
    vector<vector<int>> floodFill(vector<vector<int>>& image, int sr, int sc, int newColor) {
        if (image[sr][sc] != newColor)
            dfs(image, sr, sc, image[sr][sc], newColor);
        return image;
    }
    
    void dfs(vector<vector<int>>& image, int i, int j, int oldColor, int newColor) {
        if (i < 0 || j < 0 || i >= image.size() || j >= image[0].size() || image[i][j] != oldColor)
            return;
        image[i][j] = newColor;
        dfs(image, i - 1, j, oldColor, newColor);
        dfs(image, i, j - 1, oldColor, newColor);
        dfs(image, i, j + 1, oldColor, newColor);
        dfs(image, i + 1, j, oldColor, newColor);
    }
};
// 32 ms

 

[LeetCode] Flood Fill

标签:递归   nbsp   cto   ace   bsp   form   osi   void   rip   

原文地址:http://www.cnblogs.com/immjc/p/7940608.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!