LeetCode – Maximum Size Subarray Sum Equals k (Java)

 

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)

Java Solution

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

Related posts:

  1. LeetCode – Minimum Size Subarray Sum (Java)
  2. LeetCode – Maximum Product Subarray (Java)
  3. LeetCode – Maximum Subarray (Java)
  4. Maximum Sum of Subarray Close to K
Category >> Algorithms >> Interview  
If you want someone to read your code, please put the code inside <pre><code> and </code></pre> tags. For example: 
<pre><code> 
String foo = "bar";
</code></pre>

  1. Alan Jeferson on 2017-7-30

    Should not
    nums = [1, -1, 5, -2, 3], k = 3
    and
    nums = [1, 3, 5, -2, -1], k = 3
    return the same?

Leave a comment

CAPTCHA

*