g0501_0600.s0542_01_matrix.Solution Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-java21 Show documentation

Java-based LeetCode algorithm problem solutions, regularly updated

There is a newer version: 1.38

package g0501_0600.s0542_01_matrix;

// #Medium #Array #Dynamic_Programming #Breadth_First_Search #Matrix
// #Algorithm_I_Day_9_Breadth_First_Search_Depth_First_Search
// #Graph_Theory_I_Day_5_Matrix_Related_Problems
// #2022_08_02_Time_7_ms_(95.83%)_Space_46.4_MB_(86.74%)

import java.util.Arrays;

/**
 * 542 - 01 Matrix\.
 *
 * Medium
 *
 * Given an `m x n` binary matrix `mat`, return _the distance of the nearest_ `0` _for each cell_.
 *
 * The distance between two adjacent cells is `1`.
 *
 * **Example 1:**
 *
 * ![](https://assets.leetcode.com/uploads/2021/04/24/01-1-grid.jpg)
 *
 * **Input:** mat = \[\[0,0,0],[0,1,0],[0,0,0]]
 *
 * **Output:** [[0,0,0],[0,1,0],[0,0,0]]
 *
 * **Example 2:**
 *
 * ![](https://assets.leetcode.com/uploads/2021/04/24/01-2-grid.jpg)
 *
 * **Input:** mat = \[\[0,0,0],[0,1,0],[1,1,1]]
 *
 * **Output:** [[0,0,0],[0,1,0],[1,2,1]]
 *
 * **Constraints:**
 *
 * *   `m == mat.length`
 * *   `n == mat[i].length`
 * *   1 <= m, n <= 10⁴
 * *   1 <= m * n <= 10⁴
 * *   `mat[i][j]` is either `0` or `1`.
 * *   There is at least one `0` in `mat`.
**/
public class Solution {
    public int[][] updateMatrix(int[][] mat) {
        int[][] dist = new int[mat.length][mat[0].length];
        for (int i = 0; i < mat.length; i++) {
            Arrays.fill(dist[i], Integer.MAX_VALUE - 100000);
        }
        for (int i = 0; i < mat.length; i++) {
            for (int j = 0; j < mat[0].length; j++) {
                if (mat[i][j] == 0) {
                    dist[i][j] = 0;
                } else {
                    if (i > 0) {
                        dist[i][j] = Math.min(dist[i][j], dist[i - 1][j] + 1);
                    }
                    if (j > 0) {
                        dist[i][j] = Math.min(dist[i][j], dist[i][j - 1] + 1);
                    }
                }
            }
        }
        for (int i = mat.length - 1; i >= 0; i--) {
            for (int j = mat[0].length - 1; j >= 0; j--) {
                if (i < mat.length - 1) {
                    dist[i][j] = Math.min(dist[i][j], dist[i + 1][j] + 1);
                }
                if (j < mat[0].length - 1) {
                    dist[i][j] = Math.min(dist[i][j], dist[i][j + 1] + 1);
                }
            }
        }
        return dist;
    }
}