leetcode-560-Subarray Sum Equals K

最新推荐文章于 2025-04-22 09:11:01 发布

原创最新推荐文章于 2025-04-22 09:11:01 发布 · 154 阅读

0 ·

CC 4.0 BY-SA版权

算法专栏收录该内容

185 篇文章

订阅专栏

本文介绍了一种求解连续子数组和等于特定值k的优化算法。通过使用哈希映射跟踪当前前缀和，可以快速找到满足条件的子数组出现次数，从而高效解决问题。

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

error:
cannot solve it.

assume T[i, j] = k, where T[i, j] is the sum of nums[i] to nums[j]. So the equations can transform to: S[j] - S[i - 1] = k. And if we know that preious the occurs of S[j] - k, which is the times of sum equal to S[i - 1]. We can easily get the answer: use a map to keep track current sum, if sum - k occur previously, accumulate it to answer.

update:
remember: initial m[0] = 1;