Lettcode 523. Continuous Subarray Sum

iven 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.

解析

每次统计连续子数组的和sum，并将sum对k取模，将模值和数组的下标存入map（put(sum%k,i)）。如果map中已经存在这么一个sum，那么说明（i，j]的数，就是使得和为key的序列。

解法

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