LeetCode 675. Cut Off Trees for Golf Event

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.

题意：

0代表障碍物，不能通过

1代表陆地，可以通过

大于1的数字代表树的高度，可以通过

要求砍掉所有的树，并且总是先砍最矮的树

从（0,0）位置开始，输出砍掉所有的树所需的最少步数

代码：

class Solution {
public:
    //四个方向的偏移量数组
    int dir[4][2] = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}};
    int bfs(vector<vector<int>>& forest,int m,int n,int x,int y,int dx,int dy){
        if(x == dx && y==dy) return 0;
        int steps = 0;
        queue<pair<int,int> >que;//队列用来存放从(x,y)到(dx,dy)的路径
        que.push({x, y});
        vector<vector<int> > vis(m,vector<int>(n, 0));//用来标记走过的位置
        vis[x][y] = 1;
        while(!que.empty()){//计算从(x,y)到(dx,dy)最少需要多少步
            int size = que.size();
            steps++;
            while(size){//每向四个方向走一步，步数加1
                int cx = que.front().first;
                int cy = que.front().second;
                que.pop();
                for(int i = 0; i < 4; i++){
                    int tx = cx + dir[i][0], ty = cy + dir[i][1];
                    if(tx >= 0 && tx < m && ty >= 0 && ty < n && vis[tx][ty] == 0 && forest[tx][ty]){
                        if(tx == dx && ty == dy) return steps;
                        vis[tx][ty] = 1;
                        que.push({tx, ty});
                    }
                }
                size--;
            }
        }
        return -1;//如果从(x,y)不能到达(dx,dy)返回-1
    }
    int cutOffTree(vector<vector<int>>& forest) {
        int m = forest.size();
        if(m == 0) return -1;
        int n = forest[0].size();
        int res = 0;
        vector<vector<int> > heights;
        for(int i = 0; i<m; i++){
            for(int j = 0; j<n; j++){//将每棵树的高度和位置保存在heights数组中
                if(forest[i][j] > 1)heights.push_back({forest[i][j], i, j});
            }
        }
        sort(heights.begin(), heights.end());//按树的高度从小到大排序（默认按第一列进行排序）
        int x = 0, y = 0;
        int steps;
        for(int i = 0; i<heights.size(); i++){//计算两棵树之间所需的最少步数
            steps = bfs(forest, m, n, x, y, heights[i][1], heights[i][2]);
            if(steps == -1) return -1;
            res += steps;
            x = heights[i][1];
            y = heights[i][2];
        }
        return res;
    }
};