#733. Flood Fill

Description

An image is represented by an m x n integer grid image where image[i][j] represents the pixel value of the image.

You are also given three integers sr, sc, and newColor. You should perform a flood fill on the image starting from the pixel image[sr][sc].

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), and so on. Replace the color of all of the aforementioned pixels with newColor.

Return the modified image after performing the flood fill.

Examples

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) (i.e., the red pixel), all pixels connected by a path of the same color as the starting pixel (i.e., the blue pixels) 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.

Example 2:

Input: image = [[0,0,0],[0,0,0]], sr = 0, sc = 0, newColor = 2
Output: [[2,2,2],[2,2,2]]

Constraints:
m == image.length
n == image[i].length
1 <= m, n <= 50
0 <= image[i][j], newColor < 216
0 <= sr < m
0 <= sc < n

思路

就是dfs,但需要注意的是进入dfs前的判断条件,如果 oldColor == newColor,就不用往下继续了,否则会死循环

代码

class Solution {
    public int[][] changeColor(int[][] image, int i, int j, int newColor, int oldColor) {
        image[i][j] = newColor;
        
        if (j + 1 < image[0].length && image[i][j + 1] == oldColor)
            image = changeColor(image, i, j + 1, newColor, oldColor);
        if (j - 1 >= 0 && image[i][j - 1] == oldColor)
            image = changeColor(image, i, j - 1, newColor, oldColor);
        if (i + 1 < image.length && image[i + 1][j] == oldColor)
            image = changeColor(image, i + 1, j, newColor, oldColor);
        if (i - 1 >= 0 && image[i - 1][j] == oldColor)
            image = changeColor(image, i - 1, j, newColor, oldColor);
        
        return image;
    }
    public int[][] floodFill(int[][] image, int sr, int sc, int newColor) {
        if (newColor == image[sr][sc])
            return image;
        return changeColor(image, sr, sc, newColor, image[sr][sc]);
    }
}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值