zoukankan      html  css  js  c++  java
  • [leetcode-733-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].

    思路:

    DFS即可,但是发现一个怪现象,就是在主函数里面必须加上如下判断,要不然不能ac,不知道为什么。。。

    if(image[sr][sc] != newColor)
    void fill(vector<vector<int>>& image,int m,int n,int r,int c,int color,int newcolor)
    {
        if(r < 0 || r >= m || c < 0 || c>= n || image[r][c] != color)return;
        image[r][c] = newcolor;
        fill(image,m,n,r+1,c,color,newcolor);
        fill(image,m,n,r-1,c,color,newcolor);
        fill(image,m,n,r,c+1,color,newcolor);
        fill(image,m,n,r,c-1,color,newcolor);
    }
    vector<vector<int>> floodFill(vector<vector<int>>& image, int sr, int sc, int newColor)
    {
        int m = image.size(),n = image[0].size();
    
        if(image[sr][sc] != newColor)fill(image,m,n,sr,sc,image[sr][sc],newColor);
        
        return image;        
    }
  • 相关阅读:
    oracle 进阶之model子句
    SiteMesh的使用--笔记
    JZ49:把字符串转换成整数
    面试题45:把数组排成最小的数
    面试题43:1~n整数中1出现的次数
    面试题42:连续子数组的最大和
    面试题41:数据中的中位数
    面试题40:最小的k个数
    面试题39:数组中出现次数超过一半的数字
    面试题38:字符串的排列
  • 原文地址:https://www.cnblogs.com/hellowooorld/p/8066516.html
Copyright © 2011-2022 走看看