Subarray 问题

最新推荐文章于 2023-06-24 14:59:37 发布

原创

最新推荐文章于 2023-06-24 14:59:37 发布 · 537 阅读

0 ·

CC 4.0 BY-SA版权

本文介绍了Subarray问题的常见解题思路，包括转化求和、最大子数组和/积、变种问题及最短子数组的双指针方法。特别讨论了如何利用DP解决重复子数组的最大长度问题。

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

Subarray 问题常用思路

1. 从第i个到第j个 subarray 之和转换成 sum(0,,j) - sum(0,,i)

使用典型题目：sum divide by k， sum equal to k，sum multiple of k

2. maximum subarray sum / product

单一subarray问题，可以思考当1 pass到第i个的时候和已知包含（i-1）个关系，同时维持一个全局变量来记录所有已知的最优解

product稍微复杂一点，需要考虑0 reset 的问题

max_so_far is updated by taking the maximum value among:

Current number.

This value will be picked if the accumulated product has been really bad (even compared to the current number). This can happen when the current number has a preceding zero (e.g. [0,4]) or is preceded by a single negative number (e.g. [-3,5]).

Product of last max_so_far and current number.

This value will be picked if the accumulated product has been steadily increasing (all positive numbers).
<