package question;

import java.util.Arrays;
import java.util.HashMap;
import java.util.Map;

public class Question523 {
    public static void main(String[] args) {
        int[] ints = {23, 2, 4, 6, 7};
        int k = 6;
        new Question523().checkSubarraySum(ints, k);
    }

    public boolean checkSubarraySum(int[] nums, int k) {
        int n = nums.length;
        int[] dp = Arrays.copyOf(nums, n);
        for (int i = 1; i < n; i++) {
            for (int j = 0; j + i < n; j++) {
                dp[j] = dp[j] + nums[i + j];
                if (k == 0) {
                    if (dp[j] == 0) return true;
                } else {
                    if (dp[j] % k == 0) return true;
                }
            }
        }
        return false;
    }

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