GoLang Solution For LeetCode Problem: 01 Matrix
Solving 01 Matrix in go. Please try yourself first to solve the problem and submit your implementation to LeetCode before looking into solution.
Given a matrix consists of 0 and 1, find the distance of the nearest 0 for each cell.
The distance between two adjacent cells is 1.
Input: [[0,0,0], [0,1,0], [0,0,0]] Output: [[0,0,0], [0,1,0], [0,0,0]]
Input: [[0,0,0], [0,1,0], [1,1,1]] Output: [[0,0,0], [0,1,0], [1,2,1]]
- The number of elements of the given matrix will not exceed 10,000.
- There are at least one 0 in the given matrix.
- The cells are adjacent in only four directions: up, down, left and right.
See the full details of the problem 01 Matrix at LeetCode
Originally posted at: @github.com/halfrost/LeetCode-Go