第300场周赛

最新推荐文章于 2024-07-12 18:02:43 发布

julia点c

最新推荐文章于 2024-07-12 18:02:43 发布

阅读量100

点赞数

分类专栏： leetcode周赛文章标签：算法

本文链接：https://blog.csdn.net/xl160917219/article/details/125589473

版权

leetcode周赛专栏收录该内容

7 篇文章 0 订阅

订阅专栏

解密消息

class Solution {
public:
    string decodeMessage(string key, string message) {
        unordered_map<char,char>hash;
        char u='a';
        for(int i=0;i<key.size();i++)
        {
            if(key[i]==' ') continue;
            if(!hash[key[i]])
            {
                hash[key[i]]=u;
                u++;
            }
            
        }
         
        string ans;
        for(int i=0;i<message.size();i++)
        {
            if(message[i]==' ') {
               ans+=" ";
               continue;
 
            }
            ans+=hash[message[i]];
        }
        return ans;
    }
};

螺旋矩阵 IV

class Solution {
public:
    vector<vector<int>> spiralMatrix(int m, int n, ListNode* head) {
        vector<vector<int>>res(m,vector<int>(n,-1));
        ListNode*cur=head;
        int l=0,r=n-1,u=0,d=m-1;
        while(cur)
        {
            for(int i=l;i<=r;i++)
            {
                if(!cur) break;
                
                     res[u][i]=cur->val;
                     cur=cur->next;
            }
            if(++u>=m) break;
            for(int i=u;i<=d;i++)
            {
                if(!cur) break;
                res[i][r]=cur->val;
                cur=cur->next;
            }
            if(--r<0) break;
            for(int i=r;i>=l;i--)
            {
                if(!cur) break;
                res[d][i]=cur->val;
                cur=cur->next;
            }
            if(--d<0) break;
            for(int i=d;i>=u;i--)
            {
                if(!cur) break;
                res[i][l]=cur->val;
                cur=cur->next;
            }
            if(++l>=n) break;

        }
        return res;
    }
};

知道秘密的人数

思路:https://leetcode.cn/problems/number-of-people-aware-of-a-secret/solution/by-tsreaper-yjwu/

class Solution {
    const int MOD = 1000000007;

public:
    int peopleAwareOfSecret(int n, int delay, int forget) {
        vector<long long> f(n + 1), g(n + 1);
        f[1] = g[1] = 1;
        for (int i = 2; i <= n; i++) {
            int L = max(0, i - forget);
            int R = max(0, i - delay);
            f[i] = (g[R] - g[L] + MOD) % MOD;
            g[i] = (g[i - 1] + f[i]) % MOD;
        }
        return (g[n] - g[max(0, n - forget)] + MOD) % MOD;
    }
};

网格图中递增路径的数目

const int N = 1010, MOD = 1e9 + 7;

int f[N][N];

class Solution {
public:
    int n, m;
    vector<vector<int>> g;
    int dx[4] = {-1, 0, 1, 0}, dy[4] = {0, 1, 0, -1};

    int dp(int x, int y) {
        int& v = f[x][y];
        if (v != -1) return v;

        v = 1;
        for (int i = 0; i < 4; i ++ ) {
            int a = x + dx[i], b = y + dy[i];
            if (a >= 0 && a < n && b >= 0 && b < m && g[a][b] > g[x][y])
                v = (v + dp(a, b)) % MOD;
        }
        return v;
    }

    int countPaths(vector<vector<int>>& grid) {
        n = grid.size(), m = grid[0].size();
        g = grid;
        for (int i = 0; i < n; i ++ )
            for (int j = 0; j < m; j ++ ) 
                f[i][j] = -1;

        int res = 0;
        for (int i = 0; i < n; i ++ )
            for (int j = 0; j < m; j ++ )
                res = (res + dp(i, j)) % MOD;
        return res;
    }
};