leetcode 913(2022 1.4)

最新推荐文章于 2024-04-12 20:35:29 发布

Folivora懒懒

最新推荐文章于 2024-04-12 20:35:29 发布

阅读量166

点赞数

分类专栏： leetcode 文章标签： leetcode 动态规划深度优先

本文链接：https://blog.csdn.net/qq_52191741/article/details/122308579

版权

动态规划猫鼠游戏深度优先搜索状态转移二维数组

关键词由CSDN通过智能技术生成

leetcode 专栏收录该内容

11 篇文章 0 订阅

订阅专栏

const int MOUSE_WIN = 1;
const int CAT_WIN = 2;
const int DRAW = 0;
const int MAXN = 51;
class Solution {
    int n;
    int dp[MAXN * 2][MAXN][MAXN];
    vector<vector<int>> g;
public:
    int catMouseGame(vector<vector<int>>& graph) {
        n = graph.size();
        g = graph;
        memset(dp, -1, sizeof(dp));
        return dfs(0, 1, 2);
    }
    int dfs(int k, int a, int b) {
        int ans = dp[k][a][b];
        if (a == 0) ans = 1;
        else if (a == b) ans = 2;
        else if (k >= 2 * n) ans = 0;
        else if (ans == -1) {
            bool win = false, draw = false;
            if (k % 2 == 0) { // mouse
                
                for (int ne : g[a]) {
                    int t = dfs(k + 1, ne, b);
                    if (t == 1)
                    {
                        win = true;
                        break;
                    }
                    else if (t == 0)
                    {
                        draw = true;
                    }
                }
                if (win) ans = 1;
                else if (draw) ans = 0;
                else ans = 2;
            } else { // cat
                for (int ne : g[b]) {
                    if (ne == 0) continue;
                    int t = dfs(k + 1, a, ne);
                    if (t == 2) {
                        win = true;
                        break;
                    }
                    else if (t == 0) {
                        draw = true;
                    }
                }
                if (win) ans = 2;
                else if (draw) ans = 0;
                else ans = 1;
            }
        }
        dp[k][a][b] = ans;
        return ans;
    }

};