0BFS LeetCode1091. 二进制矩阵中的最短路径

分析

广度优先 每向外扩展一层数字加一直到最终扩不动了，需要借助标记数组来判断结点是否已经被访问过了，不能靠改变结点的数值来判断是否已经遍历过了，否则会出现结点重复访问。

class Solution {
    public int shortestPathBinaryMatrix(int[][] grid) {
int n = grid.length;
if (grid[0][0] == 1 || grid[n-1][n-1] == 1) {
	return -1;
}
boolean[][] visited = new boolean[n][n];
for (int i = 0; i < n; i++) {
	for (int j = 0; j < n; j++) {
		if (grid[i][j] == 1) {
			visited[i][j] = true;
		}
	}
}

Queue<int[]> queue = new LinkedList<>();
queue.offer(new int[]{0,0});
visited[0][0] = true;
int step = 1;
int[][] dir = new int[][]{{1,0},{-1,0},{0,-1},{0,1},{-1,-1},{-1,1},{1,-1},{1,1}};
while (!queue.isEmpty()) {
	int size = queue.size();
	for (int i = 0; i < size; i++) {
		int[] arr = queue.poll();
		grid[arr[0]][arr[1]] = step;
		for (int[] di : dir) {
			int ni = arr[0] + di[0];
			int nj = arr[1] + di[1];
			if (ni < 0 || ni >= n || nj < 0 || nj >= n || visited[ni][nj]) {
				continue;
			}
			queue.offer(new int[]{ni,nj});
			visited[ni][nj] = true;
		}
	}
	step++;
}
if (grid[n-1][n-1] == 0) {
	return -1;
}
return grid[n-1][n-1];
    }
}