# 325. 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.

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

Example 1:

``````Input: _nums_ = [1, -1, 5, -2, 3], _k_ = 3
Output: 4
Explanation: The subarray [1, -1, 5, -2] sums to 3 and is the longest.
``````

Example 2:

``````Input: _nums_ = [-2, -1, 2, 1], _k_ = 1
Output: 2
Explanation: The subarray [-1, 2] sums to 1 and is the longest.
``````

Can you do it in O( n ) time?

nums: [1, -1, 5, -2, 3], k = 3

sums: [1, 0, 5, 3, 6]

nums: [-2, -1, 2, 1], k = 1

sums: [-2, -3, -1, 0]

nums: [1, 0, -1], k = -1

sums: [1, 1, 0]

``````class Solution {
public:
int maxSubArrayLen(vector<int>& nums, int k) {
if (nums.empty()) return 0;
int res = 0;
unordered_map<int, vector<int>> m;
m[nums[0]].push_back(0);
vector<int> sum = nums;
for (int i = 1; i < nums.size(); ++i) {
sum[i] += sum[i - 1];
m[sum[i]].push_back(i);
}
for (auto it : m) {
if (it.first == k) res = max(res, it.second.back() + 1);
else if (m.find(it.first - k) != m.end()) {
res = max(res, it.second.back() - m[it.first - k][0]);
}
}
return res;
}
};
``````

``````class Solution {
public:
int maxSubArrayLen(vector<int>& nums, int k) {
int sum = 0, res = 0;
unordered_map<int, int> m;
for (int i = 0; i < nums.size(); ++i) {
sum += nums[i];
if (sum == k) res = i + 1;
else if (m.count(sum - k)) res = max(res, i - m[sum - k]);
if (!m.count(sum)) m[sum] = i;
}
return res;
}
};
``````

Minimum Size Subarray Sum

Range Sum Query - Immutable

https://leetcode.com/problems/maximum-size-subarray-sum-equals-k/

https://leetcode.com/discuss/77879/o-n-super-clean-9-line-java-solution-with-hashmap

LeetCode All in One 题目讲解汇总(持续更新中…)

 微信打赏 Venmo 打赏
（欢迎加入博主的知识星球，博主将及时答疑解惑，并分享刷题经验与总结，试运营期间前五十位可享受半价优惠～）

×

Help us with donation