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?
public class Solution {
public int maxSubArrayLen(int[] nums, int k) {
}
}
容易想到的思路如下:
以每个字母作为首字母循环 nums.length 遍
每次逐位向后加sum
如果在hashmap存在
找到结果,返回
【优化】
即使当前的sum不在hashmap中,但是为了不浪费已经加过的数,考虑其中的一部分可能满足条件:
把subarray分成两部分,后半部分如果是k也算不枉一路相加,而前半部分肯定在hashmap中了