LeetCode 325. Maximum Size Subarray Sum Equals k（和为k的最长子数组）

原题网址:https://leetcode.com/problems/maximum-size-subarray-sum-equals-k/

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.

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)

Follow Up:
Can you do it in O(n) time?

方法一：通过累计和，枚举所有可能的子数组，时间复杂度O(n^2)。

public class Solution {
    public int maxSubArrayLen(int[] nums, int k) {
        int[] sums = new int[nums.length];
        for(int i=0; i<nums.length; i++) {
            if (i==0) sums[i] = nums[i];
            else sums[i] = sums[i-1] + nums[i];
        }
        int max = 0;
        for(int i=0; i<nums.length; i++) {
            if (sums[i]==k) max=Math.max(max, i+1);
        }
        for(int i=1; i<nums.length; i++) {
            for(int j=i; j<nums.length; j++) {
                if (sums[j]-sums[i-1]==k) max=Math.max(max, j-i+1);
            }
        }
        return max;
    }
}

方法二：如何降低方法一的复杂度？方法就是使用哈希映射，即将起始位置的累计和作为键，下表作为值，保存到哈希映射中。

public class Solution {
    public int maxSubArrayLen(int[] nums, int k) {
        int[] sums = new int[nums.length];
        for(int i=0; i<nums.length; i++) {
            if (i==0) sums[i] = nums[i];
            else sums[i] = sums[i-1] + nums[i];
        }
        int max = 0;
        Map<Integer, Integer> map = new HashMap<>();
        for(int i=0; i<nums.length; i++) {
            if (sums[i]==k) max=Math.max(max, i+1);
            else {
                Integer j=map.get(sums[i]-k);
                if (j!=null) max = Math.max(max, i-j);
            }
            if (!map.containsKey(sums[i])) map.put(sums[i], i);
        }
        return max;
    }
}