1263. 推箱子

最新推荐文章于 2024-07-20 09:51:47 发布

郭涤生

最新推荐文章于 2024-07-20 09:51:47 发布

阅读量40

点赞数

文章标签：算法动态规划 c++ leetcode

本文链接：https://blog.csdn.net/lianghudream/article/details/130551271

版权

推箱子

解题思路

bfs题目

代码

class Solution {
public:
    int minPushBox(vector<vector<char>> &grid) {
        int m = grid.size();
        int n = grid[0].size();
        int sx, sy, bx, by;
        for (int x = 0; x < m; x++) { // 获取人和箱子的起始位置
            for (int y = 0; y < n; y++) {
                if (grid[x][y] == 'S') {
                    sx = x;
                    sy = y;
                } else if (grid[x][y] == 'B') {
                    bx = x;
                    by = y;
                }
            }
        }

        auto IsNotWall = [&](int x, int y)->bool{
            return x >= 0 && x < m && y >= 0 && y < n && grid[x][y] != '#';
        };

        vector<int> dir = {0, -1, 0, 1, 0};
        vector<vector<int>> dp(m*n, vector<int>(m*n, INT_MAX));
        queue<pair<int, int>> q;
        dp[sx*n + sy][bx*n + by] = 0;
        q.push({sx*n + sy, bx*n + by});
        while (!q.empty()) {
            queue<pair<int, int>>q1;
            while (!q.empty()) {
                auto [s1, b1] = q.front();
                q.pop();
                int sx1 = s1 / n;
                int sy1 = s1 % n;
                int bx1 = b1 / n;
                int by1 = b1 % n;
                if (grid[bx1][by1] == 'T') {
                    return dp[s1][b1];
                }

                for (int i = 0; i < 4; i++) {
                    int sx2 = sx1 + dir[i];
                    int sy2 = sy1 + dir[i + 1];
                    int s2 = sx2 * n + sy2;
                    if (!IsNotWall(sx2, sy2)) {
                        continue;
                    }

                    if (bx1 == sx2 && by1 == sy2) {
                        int bx2 = bx1 + dir[i];
                        int by2 = by1 + dir[i + 1];
                        int b2 = bx2 * n + by2;
                        if (!IsNotWall(bx2, by2) || dp[s2][b2] <= dp[s1][b1] + 1) {
                            continue;
                        }

                        dp[s2][b2] = dp[s1][b1] + 1;
                        q1.push({s2,b2});
                    } else {
                        if (dp[s2][b1] <= dp[s1][b1]) {
                            continue;
                        }

                        dp[s2][b1] = dp[s1][b1];
                        q.push({s2, b1});
                    }
                }
            }
            q.swap(q1);
        }

        return -1;
    }
};