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:

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?

 

 1 public class Solution {
 2     public int maxSubArrayLen(int[] nums, int k) {
 3         if (nums == null) return 0;
 4         
 5         HashMap<Integer, Integer> map = new HashMap<Integer, Integer>();
 6         int sum = 0, maxLen = 0;
 7         for (int i = 0; i < nums.length; i++) {
 8             sum += nums[i];
 9             
10             if (sum == k) maxLen = i + 1;
11             else if (map.containsKey(sum - k) ) maxLen = Math.max(maxLen, i - map.get(sum - k));
12             if (!map.containsKey(sum)) map.put(sum, i);
13         }
14         return maxLen;
15     }
16 }

 

转载于:https://www.cnblogs.com/amazingzoe/p/6727582.html