523. Continuous Subarray Sum

Description

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 the 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.
Note:
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.

Problem URL

---

Solution

给一元素非负的数组和一个k，问数组中是否有一个连续子数组，长度至少为2，的和是k的倍数。

I would use a array to contain the sum value from index 0 to ith. Then maintain different window size start from 2 to nums.length to get the sum value from left to left + w. There is a corner case that k == 0, when the sum value is 0 too, It will return true.

Code

class Solution {
    public boolean checkSubarraySum(int[] nums, int k) {
        if (nums.length == 0){
            return false;
        }
        int[] sum = new int[nums.length + 1];
        for (int i = 1; i <= nums.length; i++){
            sum[i] += sum[i - 1] + nums[i - 1];
        }
        
        for (int w = 2; w <= nums.length; w++){
            for (int left = 0; left + w < sum.length; left++){
                if (k != 0 && (sum[left + w] - sum[left]) % k == 0){
                    return true;
                }
                else if (k == 0 && (sum[left + w] - sum[left]) == 0){
                    return true;
                }
            }
        }
        return false;
    }
}

Time Complexity: O(n^2)
Space Complexity: O(n)

---

Review

1. Running sum from first element to index i : sum_i. If we mod k, it will be some format like : sum_i = k * x + modk_1
2. Running sum from first element to index j : sum_j. If we mod k, it will be some format like : sum_j = k * y + modk_2

If they have the same mod, which is modk_1 == modk_2, subtracting these two running sum we get the difference sum_i - sum_j = (x - y) * k = constant * k, and the difference is the sum of elements between index i and j, and the value is a multiple of k.

We iterate through the input array exactly once, keeping track of the running sum mod k of the elements in the process. If we find that a running sum value at index j has been previously seen before in some earlier index i in the array, then we know that the sub-array (i,j] contains a desired sum.

class Solution {
    public boolean checkSubarraySum(int[] nums, int k) {
        Map<Integer, Integer> map = new HashMap<>();
        map.put(0, -1);
        int curSum = 0;
        for (int i = 0; i < nums.length; i++){
            curSum += nums[i];
            if (k != 0){
                curSum %= k;
            }
            Integer prev = map.get(curSum);
            if (prev != null){
                if (i - prev > 1){
                    return true;
                }
            }
            else{
                map.put(curSum, i);
            }
        }
        return false;
    }
}

Time Complexity: O(n)
Space Complexity: O(k)