LeetCode 325. Maximum Size Subarray Sum Equals k(java)

Given an array nums and a target value k, find the maximum length of a subarray that sums to k. If there isn’t one, return 0 instead.

Note:
The sum of the entire nums array is guaranteed to fit within the 32-bit signed integer range.

Example 1:
Given nums = [1, -1, 5, -2, 3], k = 3,
return 4. (because the subarray [1, -1, 5, -2] sums to 3 and is the longest)

Example 2:
Given nums = [-2, -1, 2, 1], k = 1,
return 2. (because the subarray [-1, 2] sums to 1 and is the longest)

先求出每个位置的从index = 0加到此位置的和，这时（和i - 和j） 就是j~i之间的subarray的和，因此，我们用hashmap的方法来检测target-sum1=sum2中的sum2是否存在，当遍历到sum1的时候，思路类似于two sum的hashmap方法。

//HashMap的方法，O（n）空间，O（n）时间。
    public int maxSubArrayLen(int[] nums, int k) {
        if (nums.length == 0) return 0;
        int sum = 0, max = 0;
        HashMap<Integer,Integer> map = new HashMap<>();
        map.put(0, -1);
        for (int i = 0; i < nums.length; i++) {
            sum += nums[i];
            if (map.containsKey(sum - k)) {
                max = Math.max(max, i - map.get(sum - k));
            }
            if (!map.containsKey(sum)) map.put(sum, i);
        }
        return max;
    }