【LeetCode 523】 Continuous Subarray Sum

最新推荐文章于 2025-02-16 11:05:14 发布

原创最新推荐文章于 2025-02-16 11:05:14 发布 · 178 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

LeetCode 专栏收录该内容

295 篇文章

订阅专栏

本文介绍了一种解决LeetCode上特定题目“连续子数组求和”的算法思路及实现。该题目要求检查一个非负数数组中是否存在长度至少为2的连续子数组，其元素和为给定整数k的倍数。文章详细解释了如何通过哈希表记录子数组和的模运算结果来快速判断，并给出了C++代码实现。

题目描述

Given a list of non-negative numbers and a target integer k, write a function to check if the array has a continuous subarray of size at least 2 that sums up to a multiple of k, that is, sums up to n*k where n is also an integer.

Example 1:

Input: [23, 2, 4, 6, 7],  k=6
Output: True
Explanation: Because [2, 4] is a continuous subarray of size 2 and sums up to 6.
Example 2:

Input: [23, 2, 6, 4, 7],  k=6
Output: True
Explanation: Because [23, 2, 6, 4, 7] is an continuous subarray of size 5 and sums up to 42.

Constraints:

The length of the array won’t exceed 10,000.
You may assume the sum of all the numbers is in the range of a signed 32-bit integer.

思路

计算连续子串和sum，如果sum%k=n，那么前一个结果是n的子串下一个位置到当前位置合法。哈希记录所有的sum%k的结果对应的位置。
因为只需要判断是否有这种子串，且长度要求越长越好，那么相同结果只需要更新第一次。

代码：

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

        return false;
    }
};