暑假算法7.30，Day29

暑假算法7.30，Day29

动态规划

第一题

知道秘密的人数

class Solution {
    static public int peopleAwareOfSecret(int n, int delay, int forget) {
        int mod = 1_000_000_007;
        int[] sums = new int[n + 1];
        sums[1] = 1;
        for (int i = 1; i <= delay; i++) {
            sums[i] = 1;
        }
        for (int i = delay + 1; i <= forget; i++) {
            sums[i] = (sums[i - delay] + sums[i - 1]) % mod;
        }
        for (int i = forget + 1; i <= n; i++) {
            sums[i] = (sums[i - delay] - sums[i - forget] + mod) % mod;
            sums[i] = (sums[i] + sums[i - 1]) % mod;
        }
        return (sums[n] - sums[n - forget] + mod) % mod;
    }
}

第二题

网格中的最小路径代价

class Solution {
public:
    int minPathCost(vector<vector<int>>& grid, vector<vector<int>>& moveCost) {
        int i,j,ij,m=grid.size(),n=grid[0].size();
        int a[m][n];
        for(i=0;i<m;++i) for(j=0;j<n;++j) a[i][j] = 100000000;
        for(i=0;i<n;++i) a[0][i] = grid[0][i];
        for(ij=0;ij<m-1;++ij){
            for(i=0;i<n;++i){
                for(j=0;j<n;++j){
                    a[ij+1][j] = min(a[ij+1][j], a[ij][i] +grid[ij+1][j] + moveCost[grid[ij][i]][j]);
                }
            }
        }
        int ans = 1000000000;
        for(i=0;i<n;++i) ans = min(ans, a[m-1][i]);
        return ans;
    }
};

第三题

.适合打劫银行的日子

class Solution
{
public:
    vector<int> goodDaysToRobBank(vector<int> &security, int time)
    {
        vector<int> left = {0};
        vector<int> right = {0};
        vector<int> vec;
        if (time == 0)
        {
            for (int i = 0; i < security.size(); i++)
                vec.push_back(i);
            return vec;
        }
        for (int i = 1; i < security.size(); i++)
        {
            if (security[i] > security[i - 1])
                left.push_back(0);
            else
                left.push_back(left[i - 1] + 1);
        }
        for (int i = security.size() - 2; i >= 0; i--)
        {
            if (security[i] > security[i + 1])
                right.push_back(0);
            else
                right.push_back(right[right.size() - 1] + 1);
        }
        for (int i = 0; i < left.size(); i++)
        {
            if (left[i] >= time && right[security.size() - i - 1] >= time)
                vec.push_back(i);
        }
        return vec;
    }
};