(int[] nums, int k)
| 3 | |
| 4 | class Solution { |
| 5 | public boolean checkSubarraySum(int[] nums, int k) { |
| 6 | HashMap<Integer, Integer> map = new HashMap<>(); |
| 7 | map.put(0, -1); |
| 8 | int sum = 0; |
| 9 | for (int i = 0; i<nums.length; i++) { |
| 10 | sum += nums[i]; |
| 11 | int rem = sum%k; |
| 12 | if (map.containsKey(rem)) |
| 13 | if (i - map.get(rem)>=2) |
| 14 | return true; |
| 15 | if (!map.containsKey(rem)) |
| 16 | map.put(rem, i); |
| 17 | } |
| 18 | return false; |
| 19 | } |
| 20 | } |