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)
Follow Up:
Can you do it in O(n) time?
public class Solution {
public int maxSubArrayLen(int[] nums, int k) {
int sum = 0;
HashMap<Integer, Integer> map = new HashMap<>();//key:prefix和; value:到第几个数
int max = Integer.MIN_VALUE;
map.put(0, -1); //一个元素都没有的时候sum就是0啦,这个时候index是-1
for (int i = 0; i < nums.length; i++) {
sum += nums[i];
int lookingfor = sum - k;
if (map.containsKey(lookingfor)) {
max = Math.max(max, i - map.get(lookingfor));
}
if (!map.containsKey(sum)) //没有此元素时才添加,有了就不加了,肯定是前面的比较长。例子[1,-1,5,-2,3]
map.put(sum, i);
}
if (max == Integer.MIN_VALUE)
return 0;
return max;
}
}