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:
0
represents theobstacle
can't be reached.1
represents theground
can be walked through.The place with number bigger than 1
represents atree
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.
要求按从低到高的顺序“砍树”,求砍掉全部树的最小步数。思路很简单,将树的位置按树的高度从小到大排序,然后依次求当前点到下一个树的位置的最小距离,求最小距离用bfs算法。
代码:
class Solution {
public:
int cutOffTree(vector<vector<int>>& forest) {
struct cmp {
bool operator()(const vector<int>& v1, const vector<int>& v2) {
if(v1[0] == 0) return true;
if(v2[0] == 0) return false;
return v1[0] > v2[0];
}
};
priority_queue<vector<int>, vector<vector<int>>, cmp> pq;
for(int i = 0; i < forest.size(); ++i) {
for(int j = 0; j < forest[0].size(); ++j) {
pq.push({forest[i][j], i, j});
}
}
int i = 0, j = 0, ans = 0;
while(!pq.empty()) {
vector<int> nextPos = pq.top();
if(nextPos[0] == 0) break;
pq.pop();
int step = walk(forest, i, j, nextPos[1], nextPos[2]);
if(step == -1) return -1;
ans += step;
i = nextPos[1];
j = nextPos[2];
// cout << nextPos[0] << " " << i << " " << j << " " << step << endl;
}
return ans;
}
private:
int walk(vector<vector<int>>& forest, int i0, int j0, int i1, int j1) {
vector<vector<int>> walked(forest.size(), vector<int>(forest[0].size(), 0));
queue<pair<int, int>> q;
q.push({i0, j0});
walked[i0][j0] = 1;
int step = 0;
int dx[4] = {0, 1, 0, -1}, dy[4] = {1, 0, -1, 0};
while(!q.empty()) {
int n = q.size();
for(int k = 0; k < n; ++k) {
pair<int, int> p = q.front();
q.pop();
if(p.first == i1 && p.second == j1) {
return step;
}
for(int m = 0; m < 4; ++m) {
int i = p.first+dx[m], j = p.second+dy[m];
if(i >= 0 && i < forest.size() && j >= 0 && j < forest[0].size() && walked[i][j] == 0 && forest[i][j] > 0) {
q.push({i, j});
walked[i][j] = 1;
}
}
}
++step;
}
return -1;
}
};