Leetcode 325. Maximum Size Subarray Sum Equals k

最新推荐文章于 2020-11-02 06:30:20 发布

Nahida_nora

最新推荐文章于 2020-11-02 06:30:20 发布

阅读量113

点赞数

分类专栏： Leetcode 数据结构

本文链接：https://blog.csdn.net/weixin_43876597/article/details/106913124

版权

Leetcode 同时被 2 个专栏收录

98 篇文章 0 订阅

订阅专栏

数据结构

9 篇文章 0 订阅

订阅专栏

Leetcode 325. Maximum Size Subarray Sum Equals k

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.

Input: nums = [1, -1, 5, -2, 3], k = 3
Map: [1, 0], [0,1], [5,2], [3,3], [6,4]
return map.get(3)+1

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

Input: nums = [-2, -1, 2, 1], k = 1
Map: [-2, 0], [-3, 1], [-1, 2], [0,3]
return Map.get(-1) - Map.get(-2)

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