【2023/2/21~2/22 Leetcode】前缀和练习集锦

学习参考：https://labuladong.github.io/algo/di-yi-zhan-da78c/shou-ba-sh-48c1d/xiao-er-me-03265/
暂未解决：
918. 环形子数组的最大和
862. 和至少为 K 的最短子数组

1.矩阵区域和

题目来源：矩阵区域和
题解：注意边界

class Solution {
    vector<vector<int>> presum;
public:
    vector<vector<int>> matrixBlockSum(vector<vector<int>>& mat, int k) {
        int m=mat.size();
        int n=mat[0].size();
        if(m){
            //int n=mat[0].size();
            presum.resize(m+1,vector<int>(n+1));
            for(int i=1;i<=m;i++)
                for(int j=1;j<=n;j++)
                    presum[i][j]=presum[i-1][j]+presum[i][j-1]+mat[i-1][j-1]-presum[i-1][j-1];
        }
        vector<vector<int>> answer;
        answer.resize(m,vector<int>(n));
        int a1,a2,b1,b2;
        for(int i=0;i<m;i++)
            for(int j=0;j<n;j++){
                if(i-k>0)   a1=i-k;
                else a1=0;
                if(i+k<m-1)  a2=i+k;
                else a2=m-1;
                if(j-k>0)   b1=j-k;
                else b1=0;
                if(j+k<n-1)  b2=j+k;
                else b2=n-1;
                answer[i][j]=presum[a2+1][b2+1]-presum[a1][b2+1]-presum[a2+1][b1]+presum[a1][b1];
            }
        return answer;
    }
};

2. 连续的子数组和

题目来源：523.连续的子数组合

• unordered_map<int,int> mp;
  mp.count(remainder)
  mp[0]=-1

class Solution {
public:
    bool checkSubarraySum(vector<int>& nums, int k) {
        int m=nums.size();
        if(m<2) return false;
        unordered_map<int,int> mp;
        mp[0]=-1;
        int remainder=0;
        for(int i=0;i<m;i++)
        {
            remainder=(remainder+nums[i])%k;
            if(mp.count(remainder))
                {
                    int preindex=mp[remainder];
                    if(i-preindex>=2)
                        return true;
                }
            else
                mp[remainder]=i;
        }
        return false;
    }
};

3.路径总和III【没懂

题目来源：https://leetcode.cn/problems/path-sum-iii/solution/lu-jing-zong-he-iii-by-leetcode-solution-z9td/

class Solution {
public:
    unordered_map<long long, int> prefix;

    int dfs(TreeNode *root, long long curr, int targetSum) {
        if (!root) {
            return 0;
        }

        int ret = 0;
        curr += root->val;
        if (prefix.count(curr - targetSum)) {
            ret = prefix[curr - targetSum];
        }

        prefix[curr]++;//???没懂
        ret += dfs(root->left, curr, targetSum);
        ret += dfs(root->right, curr, targetSum);
        prefix[curr]--;

        return ret;
    }

    int pathSum(TreeNode* root, int targetSum) {
        prefix[0] = 1;
        return dfs(root, 0, targetSum);
    }
};

class Solution {
public:
    int rootSum(TreeNode* root,long targetSum) {
        if (!root) {
            return 0;
        }

        int ret = 0;
        if (root->val == targetSum) {
            ret++;
        } 

        ret += rootSum(root->left, targetSum - root->val);
        ret += rootSum(root->right, targetSum - root->val);
        return ret;
    }

    int pathSum(TreeNode* root, long targetSum) {
        if (!root) {
            return 0;
        }
        
        int ret = rootSum(root, targetSum);
        ret += pathSum(root->left, targetSum);
        ret += pathSum(root->right, targetSum);
        return ret;
    }
};

4. 和为k的子数组*****

题目来源：https://leetcode.cn/problems/subarray-sum-equals-k/solution/he-wei-kde-zi-shu-zu-by-leetcode-solution/

class Solution {
public:
    int subarraySum(vector<int>& nums, int k) {
        int count=0,pre=0;
        unordered_map<int,int> mp;
        //mp[0]=1;
        for(int i=0;i<nums.size();i++)
        {
            pre+=nums[i];
            if(pre==k)
                count++;
            if(mp.find(pre-k)!=mp.end())
                count+=mp[pre-k];
            mp[pre]++;
        }
        return count;
    }
};

5. 和为s的连续正数序列

题目来源：https://leetcode.cn/problems/he-wei-sde-lian-xu-zheng-shu-xu-lie-lcof/
题解：(双指针法）

class Solution {
public:
    vector<vector<int>> findContinuousSequence(int target) {
        vector<vector<int>> vec;
        vector<int> res;
        int left=1,right=2;
        while(left<right)
        {
            int sum=((left+right)*(right-left+1))/2;
            if(sum==target)
            {
                res.clear();
                for(int i=left;i<=right;i++)
                    res.emplace_back(i);
                vec.emplace_back(res);
                left++;
            }
            else if(sum<target)
                right++;
            else left++;
        }
        return vec;
    }
};

6.和可被K整除的子数组个数

题目来源：974.和可被K整除的子数组个数
题解：【注意取余可能为负数，所以需要修复！】

class Solution {
public:
    int subarraysDivByK(vector<int>& nums, int k) {
        unordered_map<int,int> mp;
        mp[0]=1;
        int m=nums.size();
        int sum=0,cnt=0;
        for(int i=0;i<m;i++)
        {
            sum+=nums[i];
            int ys=(sum%k+k)%k;//注意此处！！！
            if(mp.count(ys))
                cnt+=mp[ys];
            mp[ys]++;
        }
        return cnt;
    }
};