zoukankan      html  css  js  c++  java
  • 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].
    class Solution:
        def floodFill(self, image, sr, sc, newColor):
            """
            :type image: List[List[int]]
            :type sr: int
            :type sc: int
            :type newColor: int
            :rtype: List[List[int]]
            """
            temp = image[sr][sc]
            flag = [[1 for i in range(len(image[0]))] for j in range(len(image))]
            def solve(i,j):
                image[i][j] = newColor
                flag[i][j] = 0
                if i>0 and image[i-1][j]==temp and flag[i-1][j]:
                    # print(i-1,j)
                    solve(i-1,j)
                if i<len(image)-1 and image[i+1][j]==temp and flag[i+1][j]:
                    # print(i+1,j)
                    solve(i+1,j)
                if j>0 and image[i][j-1]==temp and flag[i][j-1]:
                    # print(i,j-1)
                    solve(i,j-1)
                if j<len(image[0])-1 and image[i][j+1]==temp and flag[i][j+1]:
                    # print(i,j+1)
                    solve(i,j+1)
            solve(sr,sc)
            return image
    
  • 相关阅读:
    关于在windows10中的vmware9.0里面安装的ubuntukylin15.04和windows共享目录的一些反思
    关于最近工程的一些心得
    关于springMVC中component-scan的问题以及springmvc.xml整理
    初学node.js有感三
    初学node.js有感二
    初学node.js有感一
    编译原理——算符优先分析文法(附源代码)
    数据结构与算法系列研究九——排序算法的一些探讨
    LeetCode: Same Tree
    LeetCode: Symmetric Tree
  • 原文地址:https://www.cnblogs.com/bernieloveslife/p/9885894.html
Copyright © 2011-2022 走看看