LeetCode 1223. 掷骰子模拟

LeetCode 1223. 掷骰子模拟

暴力递归

const int MOD = 1e9 + 7;
class Solution {
public:
    int n;
    vector<int> rm;
    int dfs(int u, int last, int rest)
    {
        if(u == n) return 1;
        int res = 0;
        for(int i = 0; i < 6; i ++)
        {
            if(last != i)
                res = (res + dfs(u + 1, i, rm[i] - 1));
            else if(rest)
                res = (res + dfs(u + 1, i, rest - 1));
        }
        return res;
    }
    int dieSimulator(int n, vector<int>& rollMax) {
        this -> n = n;
        rm = rollMax;
        int res = 0;
        for(int i = 0; i < 6; i ++)
            res = (res + dfs(1, i, rollMax[i] - 1));
        return res;
    }
};

记忆化搜索

const int N = 5010, MOD = 1e9 + 7;
class Solution {
public:
    int n;
    vector<int> rm;
    int f[N][6][16] = {0};
    int dfs(int u, int last, int rest)
    {
        if(u == n) return 1;
        if(f[u][last][rest] != -1) return f[u][last][rest];

        int res = 0;
        for(int i = 0; i < 6; i ++)
        {
            if(last != i)
                res = (res + dfs(u + 1, i, rm[i] - 1)) % MOD;
            else if(rest)
                res = (res + dfs(u + 1, i, rest - 1)) % MOD;
        }

        f[u][last][rest] = res;
        return res;
    }
    int dieSimulator(int n, vector<int>& rollMax) {
        this -> n = n;
        rm = rollMax;
        memset(f, -1, sizeof f);
        int res = 0;
        for(int i = 0; i < 6; i ++)
            res = (res + dfs(1, i, rollMax[i] - 1)) % MOD;
        return res;
    }
};