【BFS】其实这个就是把点按照从小到大的顺序排序,然后BFS算出相邻点的距离累加起来,需要注意要从(0,0)开始走,所以一开始就加入一个(0,0,1)这样即使开始的最小值在(0,0)处那么BFS算出来的距离也是0,其他套BFS模板即可。
class Solution {
List<List<Integer>> f;
int m, n;
int[] dx = {0, 0, 1, -1};
int[] dy = {1, -1, 0, 0};
public int bfs(int[] start, int[] end){
if(start[0] == end[0] && start[1] == end[1]) return 0;
int[][] visit = new int[m][n];
Deque<int[]> queue = new LinkedList();
queue.offer(start);
visit[start[0]][start[1]] = 1;
int t = 0;
while(!queue.isEmpty()){
int k = queue.size();
t++;
while(k-- > 0){
int[] tmp = queue.poll();
int x = tmp[0], y = tmp[1];
for(var i = 0; i < 4; i++){
int nx = x + dx[i], ny = y + dy[i];
if(nx >= 0 && nx < m && ny >= 0 && ny < n && visit[nx][ny] == 0 && f.get(nx).get(ny) != 0){
if(nx == end[0] && ny == end[1]) return t;
visit[nx][ny] = 1;
queue.offer(new int[] {nx, ny});
}
}
}
}
return -1;
}
public int cutOffTree(List<List<Integer>> forest) {
f = forest;
m = f.size(); n = f.get(0).size();
List<int[]> list = new ArrayList();
list.add(new int[] {0, 0, 1});
for(var i = 0; i < m; i++){
for(var j = 0; j < n; j++){
if(f.get(i).get(j) > 1) list.add(new int[] {i, j, f.get(i).get(j)});
}
}
Collections.sort(list, (a, b) -> { return a[2] - b[2]; } );
int l = list.size(), ans = 0;
for(var i = 1; i < l; i++){
int ret = bfs(list.get(i - 1), list.get(i));
if(ret == -1) return -1;
ans += ret;
}
return ans;
}
}