当前位置: 代码迷 >> 综合 >> LeetCode刷题:733. Flood Fill — DFS算法入门
  详细解决方案

LeetCode刷题:733. Flood Fill — DFS算法入门

热度:36   发布时间:2024-01-15 19:36:44.0

LeetCode刷题:733. Flood Fill

原题链接:https://leetcode.com/problems/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, newColo

  相关解决方案