## 题目描述：

LeetCode 675. Cut Off Trees for Golf Event

You are asked to cut off trees in a forest for a golf event. The forest is represented as a non-negative 2D map, in this map:

1. `0` represents the `obstacle` can't be reached.
2. `1` represents the `ground` can be walked through.
3. `The place with number bigger than 1` represents a `tree` can be walked through, and this positive number represents the tree's height.

You are asked to cut off all the trees in this forest in the order of tree's height - always cut off the tree with lowest height first. And after cutting, the original place has the tree will become a grass (value 1).

You will start from the point (0, 0) and you should output the minimum steps you need to walk to cut off all the trees. If you can't cut off all the trees, output -1 in that situation.

You are guaranteed that no two `trees` have the same height and there is at least one tree needs to be cut off.

Example 1:

```Input:
[
[1,2,3],
[0,0,4],
[7,6,5]
]
Output: 6
```

Example 2:

```Input:
[
[1,2,3],
[0,0,0],
[7,6,5]
]
Output: -1
```

Example 3:

```Input:
[
[2,3,4],
[0,0,5],
[8,7,6]
]
Output: 6
Explanation: You started from the point (0,0) and you can cut off the tree in (0,0) directly without walking.
```

Hint: size of the given matrix will not exceed 50x50.

## Java代码：

``````public class Solution {
private List<List<Integer>> forest;
private int w, h;
private int[] dx = new int[]{1, 0, -1, 0};
private int[] dy = new int[]{0, 1, 0, -1};
public int cutOffTree(List<List<Integer>> forest) {
this.forest = forest;
w = forest.size();
h = forest.get(0).size();
int ans = 0;
for (int x = 0; x < w; x++) {
for (int y = 0; y < h; y++) {
int v = forest.get(x).get(y);
if (v <= 1) continue;
};
}
trees.sort((x, y) -> x - y);
int sx = 0, sy = 0;
for (int[] tree : trees) {
int tx = tree, ty = tree;
int dist = findDist(sx, sy, tx, ty);
if (dist < 0) return -1;
ans += dist;
sx = tx;
sy = ty;
}
return ans;
}
public int findDist(int sx, int sy, int tx, int ty) {
Set<Integer> vset = new HashSet<>();
while (!queue.isEmpty()) {
int[] first = queue.poll();
int x = first, y = first, s = first;
if (x == tx && y == ty) return s;
for (int i = 0; i < dx.length; i++) {
int nx = x + dx[i];
int ny = y + dy[i];
if (nx < 0 || nx >= w || ny < 0 || ny >= h)
continue;
if (forest.get(nx).get(ny) == 0) continue;
if (vset.contains(nx * h + ny)) continue;
queue.add(new int[]{nx, ny, s + 1});
}
}
return -1;
}
}
``````

Pingbacks已关闭。