733. Flood Fill
来源:互联网 发布:mac电脑程序强制退出 编辑:程序博客网 时间:2024/06/07 17:47
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 = 2Output: [[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 connectedto 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].
思路:
BFS,从起点开始,遇到相同的像素点加入queue,从queue中取出每个像素点时,修改成最新的颜色。BFS注意已访问过的结点需要记录下来。
class Solution { public int[][] floodFill(int[][] image, int sr, int sc, int newColor) { int n = image.length; int m = image[0].length; int[][] dir = { { 1, 0 }, { -1, 0 }, { 0, 1 }, { 0, -1 } }; Queue<int[]> queue = new ArrayDeque<>(); queue.offer(new int[] {sr, sc}); Set<Integer> vis = new HashSet<>(); vis.add(sr * m + sc); while (!queue.isEmpty()) { int[] now = queue.poll(); int color = image[now[0]][now[1]]; image[now[0]][now[1]] = newColor; for (int[] d : dir) { int nx = now[0] + d[0]; int ny = now[1] + d[1]; if (nx >= 0 && nx < n && ny >= 0 && ny < m && image[nx][ny] == color && !vis.contains(nx * m + ny)) { queue.offer(new int[] {nx, ny}); vis.add(nx * m + ny); } } } return image; }}
- 733. Flood Fill
- 733. Flood Fill
- LWC 60:733. Flood Fill
- python--leetcode 733. Flood Fill
- Flood Fill
- flood fill
- 走迷宫 Flood Fill
- Flood fill 算法
- Flood Fill Image
- Flood Fill Algorithm
- Flood Fill(leetcode)
- USACO The Castle(flood fill)
- Flood Fill问题及解法
- Flood Fill Algorithms in C# and GDI+
- Flood Fill(漫水填充)算法
- 题目1460:Oil Deposit(Flood Fill)
- 泛洪填充算法(Flood Fill Algorithm)
- Flood fill Algorithm – how to implement fill() in paint?
- web应用防火墙(WAF)的安全原理与技术分析
- 结构体最后一个数组为[]、[0]、[1] 柔性数组的用法
- extend()
- XP系统下用VC实现俄罗斯方块游戏
- 在 App 中加入 AdMob 广告
- 733. Flood Fill
- 学习Hadoop第六课(初识HDFS的基本原理)
- Veket Win7PE Win10PE多启动维护优盘制作
- 文件上传利器SWFUpload入门简易教程
- 决策树、随机森林结果可视化
- 【动态更新】解决夫妻两地分居手续
- ThreadLocal源码分析
- 图片加载机制的比较
- opencv 图像直方图