1631. 最小体力消耗路径

文章目录

• 题意
• 思路
• 代码

题意

题目链接

思路

搜索

代码

class Solution {
public:
    int minimumEffortPath(vector<vector<int>>& heights) {
        int m = heights.size();
        int n = heights[0].size();
        int x_add[] = {0, 0, 1, -1};
        int y_add[] = {1, -1, 0, 0};
        if (m == 1 && n == 1)
            return 0;
        vector<vector<int>> dp;
        for (int i = 0; i < m; i++)
            dp.push_back(vector<int>(n, 0x3fffffff));
        priority_queue<pair<int, pair<int, int>>> Q;
        dp[0][0] = 0;
        Q.push(make_pair(0, make_pair(0, 0)));
        while (!Q.empty()) 
        {
            const int num = -Q.top().first;
            const int x = Q.top().second.first;
            const int y = Q.top().second.second;
          //  cout << num << " " << x <<" " << y <<endl;
            Q.pop();
            for (int i = 0; i < 4; i++) 
            {
                const int x_tmp = x + x_add[i];
                const int y_tmp = y + y_add[i];
                if (x_tmp < 0 || x_tmp >= m || y_tmp < 0 || y_tmp >= n)
                    continue;
                const int num_tmp = max(num, abs(heights[x][y] - heights[x_tmp][y_tmp]));
                if (num_tmp < dp[x_tmp][y_tmp])
                {
                    // if (x_tmp == m - 1 && y_tmp == n - 1)
                    //     return num_tmp;
                    dp[x_tmp][y_tmp] = num_tmp;
                    Q.push(make_pair(-num_tmp, make_pair(x_tmp, y_tmp)));
                }
            }
        }
        return dp[m - 1][n - 1];
    }
};