[LeetCode] Split Array with Equal Sum 分割数组成和相同的子数组
Posted Grandyang
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了[LeetCode] Split Array with Equal Sum 分割数组成和相同的子数组相关的知识,希望对你有一定的参考价值。
Given an array with n integers, you need to find if there are triplets (i, j, k) which satisfies following conditions:
- 0 < i, i + 1 < j, j + 1 < k < n - 1
- Sum of subarrays (0, i - 1), (i + 1, j - 1), (j + 1, k - 1) and (k + 1, n - 1) should be equal.
where we define that subarray (L, R) represents a slice of the original array starting from the element indexed L to the element indexed R.
Example:
Input: [1,2,1,2,1,2,1] Output: True Explanation: i = 1, j = 3, k = 5. sum(0, i - 1) = sum(0, 0) = 1 sum(i + 1, j - 1) = sum(2, 2) = 1 sum(j + 1, k - 1) = sum(4, 4) = 1 sum(k + 1, n - 1) = sum(6, 6) = 1
Note:
- 1 <= n <= 2000.
- Elements in the given array will be in range [-1,000,000, 1,000,000].
s
以上是关于[LeetCode] Split Array with Equal Sum 分割数组成和相同的子数组的主要内容,如果未能解决你的问题,请参考以下文章
LeetCode 842. Split Array into Fibonacci Sequence
[Leetcode] Split Array Largest Sum
[Leetcode] Split Array Largest Sum
**Leetcode 659. Split Array into Consecutive Subsequences