1034:边界着色
This commit is contained in:
parent
e52a76b04e
commit
6a2aaa8d73
112
src/main/java/leetcode/editor/cn/ColoringABorder.java
Normal file
112
src/main/java/leetcode/editor/cn/ColoringABorder.java
Normal file
@ -0,0 +1,112 @@
|
||||
//<p>给你一个大小为 <code>m x n</code> 的整数矩阵 <code>grid</code> ，表示一个网格。另给你三个整数 <code>row</code>、<code>col</code> 和 <code>color</code> 。网格中的每个值表示该位置处的网格块的颜色。</p>
|
||||
//
|
||||
//<p>两个网格块属于同一 <strong>连通分量</strong> 需满足下述全部条件：</p>
|
||||
//
|
||||
//<ul>
|
||||
// <li>两个网格块颜色相同</li>
|
||||
// <li>在上、下、左、右任意一个方向上相邻</li>
|
||||
//</ul>
|
||||
//
|
||||
//<p><strong>连通分量的边界</strong><strong> </strong>是指连通分量中满足下述条件之一的所有网格块：</p>
|
||||
//
|
||||
//<ul>
|
||||
// <li>在上、下、左、右任意一个方向上与不属于同一连通分量的网格块相邻</li>
|
||||
// <li>在网格的边界上（第一行/列或最后一行/列）</li>
|
||||
//</ul>
|
||||
//
|
||||
//<p>请你使用指定颜色 <code>color</code> 为所有包含网格块 <code>grid[row][col]</code> 的 <strong>连通分量的边界</strong> 进行着色，并返回最终的网格 <code>grid</code> 。</p>
|
||||
//
|
||||
//<p> </p>
|
||||
//
|
||||
//<p><strong>示例 1：</strong></p>
|
||||
//
|
||||
//<pre>
|
||||
//<strong>输入：</strong>grid = [[1,1],[1,2]], row = 0, col = 0, color = 3
|
||||
//<strong>输出：</strong>[[3,3],[3,2]]</pre>
|
||||
//
|
||||
//<p><strong>示例 2：</strong></p>
|
||||
//
|
||||
//<pre>
|
||||
//<strong>输入：</strong>grid = [[1,2,2],[2,3,2]], row = 0, col = 1, color = 3
|
||||
//<strong>输出：</strong>[[1,3,3],[2,3,3]]</pre>
|
||||
//
|
||||
//<p><strong>示例 3：</strong></p>
|
||||
//
|
||||
//<pre>
|
||||
//<strong>输入：</strong>grid = [[1,1,1],[1,1,1],[1,1,1]], row = 1, col = 1, color = 2
|
||||
//<strong>输出：</strong>[[2,2,2],[2,1,2],[2,2,2]]</pre>
|
||||
//
|
||||
//<p> </p>
|
||||
//
|
||||
//<p><strong>提示：</strong></p>
|
||||
//
|
||||
//<ul>
|
||||
// <li><code>m == grid.length</code></li>
|
||||
// <li><code>n == grid[i].length</code></li>
|
||||
// <li><code>1 <= m, n <= 50</code></li>
|
||||
// <li><code>1 <= grid[i][j], color <= 1000</code></li>
|
||||
// <li><code>0 <= row < m</code></li>
|
||||
// <li><code>0 <= col < n</code></li>
|
||||
//</ul>
|
||||
//
|
||||
//<p> </p>
|
||||
//
|
||||
//<div><div>Related Topics</div><div><li>深度优先搜索</li><li>广度优先搜索</li><li>数组</li><li>矩阵</li></div></div><br><div><li>👍 159</li><li>👎 0</li></div>
|
||||
package leetcode.editor.cn;
|
||||
|
||||
import java.util.LinkedList;
|
||||
import java.util.Queue;
|
||||
|
||||
// 1034:边界着色
|
||||
public class ColoringABorder {
|
||||
public static void main(String[] args) {
|
||||
Solution solution = new ColoringABorder().new Solution();
|
||||
// TO TEST
|
||||
}
|
||||
|
||||
//leetcode submit region begin(Prohibit modification and deletion)
|
||||
class Solution {
|
||||
public int[][] colorBorder(int[][] grid, int row, int col, int color) {
|
||||
int xLength = grid.length;
|
||||
int yLength = grid[0].length;
|
||||
boolean[][] use = new boolean[xLength][yLength];
|
||||
int[][] res = new int[xLength][yLength];
|
||||
Queue<int[]> queue = new LinkedList<>();
|
||||
queue.add(new int[]{row, col});
|
||||
use[row][col] = true;
|
||||
int[] xArr = new int[]{-1, 1, 0, 0};
|
||||
int[] yArr = new int[]{0, 0, -1, 1};
|
||||
int ori = grid[row][col];
|
||||
while (!queue.isEmpty()) {
|
||||
int[] point = queue.poll();
|
||||
int num = 0;
|
||||
for (int i = 0; i < 4; i++) {
|
||||
int x = point[0] + xArr[i];
|
||||
int y = point[1] + yArr[i];
|
||||
if (x >= xLength || x < 0 || y >= yLength || y < 0
|
||||
|| grid[x][y] != ori) {
|
||||
continue;
|
||||
}
|
||||
num++;
|
||||
if (!use[x][y]) {
|
||||
use[x][y] = true;
|
||||
queue.add(new int[]{x, y});
|
||||
}
|
||||
}
|
||||
if (num < 4) {
|
||||
res[point[0]][point[1]] = color;
|
||||
}
|
||||
}
|
||||
for (int i = 0; i < xLength; i++) {
|
||||
for (int j = 0; j < yLength; j++) {
|
||||
if (res[i][j] == 0) {
|
||||
res[i][j] = grid[i][j];
|
||||
}
|
||||
}
|
||||
}
|
||||
return res;
|
||||
}
|
||||
}
|
||||
//leetcode submit region end(Prohibit modification and deletion)
|
||||
|
||||
}
|
||||
@ -0,0 +1,54 @@
|
||||
<p>给你一个大小为 <code>m x n</code> 的整数矩阵 <code>grid</code> ，表示一个网格。另给你三个整数 <code>row</code>、<code>col</code> 和 <code>color</code> 。网格中的每个值表示该位置处的网格块的颜色。</p>
|
||||
|
||||
<p>两个网格块属于同一 <strong>连通分量</strong> 需满足下述全部条件：</p>
|
||||
|
||||
<ul>
|
||||
<li>两个网格块颜色相同</li>
|
||||
<li>在上、下、左、右任意一个方向上相邻</li>
|
||||
</ul>
|
||||
|
||||
<p><strong>连通分量的边界</strong><strong> </strong>是指连通分量中满足下述条件之一的所有网格块：</p>
|
||||
|
||||
<ul>
|
||||
<li>在上、下、左、右任意一个方向上与不属于同一连通分量的网格块相邻</li>
|
||||
<li>在网格的边界上（第一行/列或最后一行/列）</li>
|
||||
</ul>
|
||||
|
||||
<p>请你使用指定颜色 <code>color</code> 为所有包含网格块 <code>grid[row][col]</code> 的 <strong>连通分量的边界</strong> 进行着色，并返回最终的网格 <code>grid</code> 。</p>
|
||||
|
||||
<p> </p>
|
||||
|
||||
<p><strong>示例 1：</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>输入：</strong>grid = [[1,1],[1,2]], row = 0, col = 0, color = 3
|
||||
<strong>输出：</strong>[[3,3],[3,2]]</pre>
|
||||
|
||||
<p><strong>示例 2：</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>输入：</strong>grid = [[1,2,2],[2,3,2]], row = 0, col = 1, color = 3
|
||||
<strong>输出：</strong>[[1,3,3],[2,3,3]]</pre>
|
||||
|
||||
<p><strong>示例 3：</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>输入：</strong>grid = [[1,1,1],[1,1,1],[1,1,1]], row = 1, col = 1, color = 2
|
||||
<strong>输出：</strong>[[2,2,2],[2,1,2],[2,2,2]]</pre>
|
||||
|
||||
<p> </p>
|
||||
|
||||
<p><strong>提示：</strong></p>
|
||||
|
||||
<ul>
|
||||
<li><code>m == grid.length</code></li>
|
||||
<li><code>n == grid[i].length</code></li>
|
||||
<li><code>1 <= m, n <= 50</code></li>
|
||||
<li><code>1 <= grid[i][j], color <= 1000</code></li>
|
||||
<li><code>0 <= row < m</code></li>
|
||||
<li><code>0 <= col < n</code></li>
|
||||
</ul>
|
||||
|
||||
<p> </p>
|
||||
|
||||
<div><div>Related Topics</div><div><li>深度优先搜索</li><li>广度优先搜索</li><li>数组</li><li>矩阵</li></div></div><br><div><li>👍 159</li><li>👎 0</li></div>
|
||||
Loading…
Reference in New Issue
Block a user