【LeetCode】703. Flood Fill(C++)

地址:https://leetcode.com/problems/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.
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].

理解:

从起始点开始,把它四周,四周的四周。。。所有的和起始点相同的pixel置为新值。

实现:

dfs很容易实现。
但是万万没想到遇到一个问题。
就是没有考虑image[sr][sc]==newColor这种情况。这样的情况下,考虑image[1][1]==image[1][2],则会发生循环调用的情况。因此需要在最初判断一下。

class Solution {
public:
	vector<vector<int>> floodFill(vector<vector<int>>& image, int sr, int sc, int newColor) {
		if(image[sr][sc]!=newColor)
            set(image, sr, sc, image[sr][sc], newColor);
		return image;
	}

	void set(vector<vector<int>>& image, int posr, int posc,int oldColor ,int newColor) {
		int r = image.size() - 1, c = image[0].size() - 1;
		if (posr<0 || posr>r || posc<0 || posc>c|| image[posr][posc] != oldColor)
			return;
		image[posr][posc] = newColor;
		set(image, posr + 1, posc, oldColor, newColor);
		set(image, posr - 1, posc, oldColor, newColor);
		set(image, posr, posc + 1, oldColor, newColor);
		set(image, posr, posc - 1, oldColor, newColor);
	}
};

啊这么弱智的题我竟然找了半天的bug。。。

  • 0
    点赞
  • 1
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值