search

yokostan / Leetcode-Solutions

Doing exercise on Leetcode. Carry on!
0 stars 3 forks source link

Leetcode #325. Maximum Size Subarray Sum Equals k #262

Open yokostan opened 5 years ago

yokostan commented 5 years ago 
class Solution {
    public int maxSubArrayLen(int[] nums, int k) {
    int sum = 0, max = 0;
    HashMap<Integer, Integer> map = new HashMap<Integer, Integer>();
    for (int i = 0; i < nums.length; i++) {
        sum = sum + nums[i];
        if (sum == k) max = Math.max(i + 1);
        else if (map.containsKey(sum - k)) max = Math.max(max, i - map.get(sum - k));
        if (!map.containsKey(sum)) map.put(sum, i);
    }
    return max;
    }
}
yokostan commented 5 years ago

This is like prefix sum and Hash Table combined!