# 力扣689. 三个无重叠子数组的最大和


## 力扣689. Maximum Sum of 3 Non-Overlapping Subarrays（三个无重叠子数组的最大和）

找到三个无重叠子数组的最大和。

示例 1：

![](../posts/01_学习/87_LeetCode/0689_三个无重叠子数组的最大和/img/0689-1-description.png)

```
输入：nums = [1,2,1,2,6,7,5,1], k = 2
输出：[0,3,5]
```

提示：
- 1 <= nums.length <= 2 * 10^4
- 1 <= nums[i] < 2^16
- 1 <= k <= floor(nums.length / 3)