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

26 篇文章 0 订阅
16 篇文章 0 订阅

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].

这是一道典型的DFS,比较简单

代码:

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

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值