LeetCode #325 - Maximum Size Subarray Sum Equals k

LawFile

于 2019-01-30 01:56:35 发布

阅读量224

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode

本文链接：https://blog.csdn.net/LawFile/article/details/86671751

LeetCode 专栏收录该内容

625 篇文章

订阅专栏

本文探讨了如何在一个整数数组中找到和为目标值的最大长度子数组，通过使用哈希表记录前缀和的下标，确保了即使在32位整数范围内也能高效解决问题。文章提供了详细的算法思路及C++实现代码。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

题目描述：

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.

Follow Up:
Can you do it in O(n) time?

从数组头部遍历，利用哈希表记录前缀和的下标，如果前缀和有重复，保留最早的那个下标，这样可以保证子数组最长。

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