zy2317878的博客

博观约取,厚积薄发。多读书,多看报,多做事,多交流。

LeetCode-733. Flood Fill

Description

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

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

Solution 1(C++)

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;
    }

private:
    void dfs(vector<vector<int>>& image, int i, int j, int c0, int c1) {
        if (i < 0 || j < 0 || i >= image.size() || j >= image[0].size() || image[i][j] != c0) return;
        image[i][j] = c1;
        dfs(image, i, j - 1, c0, c1);
        dfs(image, i, j + 1, c0, c1);
        dfs(image, i - 1, j, c0, c1);
        dfs(image, i + 1, j, c0, c1);
    }
};

算法分析

像这种是与那种探索最长路径不一样,探索路径可能要重复访问,所以要设置标志,但这种不需要,还是感觉不是很具体。先做了再说。

程序分析

略。

阅读更多
版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/zy2317878/article/details/79955046
文章标签: LeetCode DFS
个人分类: LeetCode
上一篇LeetCode-687. Longest Univalue Path
下一篇LeetCode-225. Implement Stack using Queues
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

关闭
关闭