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;        
    }
  • 相关阅读:
    Python调用R语言
    走迷宫(用栈模拟实现非递归,并输出路径)
    走迷宫(用栈模拟实现非递归,并输出路径)
    《Python数据可视化编程实战》
    《Python数据可视化编程实战》
    一道思考题(二进制枚举的应用的想法)切金条
    Android 自己定义UI圆角button
    Oracle 用户管理(二)
    最大团解析及用处
    用反射完毕学生管理系统(包含数据库连接)
  • 原文地址:https://www.cnblogs.com/hellowooorld/p/8066516.html
Copyright © 2011-2022 走看看