【LeetCode】 1013. Partition Array Into Three Parts With Equal Sum 将数组分成和相等的三个部分（Easy）（JAVA）

【LeetCode】 1013. Partition Array Into Three Parts With Equal Sum 将数组分成和相等的三个部分（Easy）（JAVA）

题目地址: https://leetcode.com/problems/partition-array-into-three-parts-with-equal-sum/

题目描述：

Given an array A of integers, return true if and only if we can partition the array into three non-empty parts with equal sums.

Formally, we can partition the array if we can find indexes i+1 < j with (A[0] + A[1] + … + A[i] == A[i+1] + A[i+2] + … + A[j-1] == A[j] + A[j-1] + … + A[A.length - 1])

Example 1:

Input: A = [0,2,1,-6,6,-7,9,1,2,0,1]
Output: true
Explanation: 0 + 2 + 1 = -6 + 6 - 7 + 9 + 1 = 2 + 0 + 1

Example 2:

Input: A = [0,2,1,-6,6,7,9,-1,2,0,1]
Output: false

Example 3:

Input: A = [3,3,6,5,-2,2,5,1,-9,4]
Output: true
Explanation: 3 + 3 = 6 = 5 - 2 + 2 + 5 + 1 - 9 + 4

Constraints:

1. 3 <= A.length <= 50000
2. -10^4 <= A[i] <= 10^4

题目大意

给你一个整数数组 A，只有可以将其划分为三个和相等的非空部分时才返回 true，否则返回 false。

形式上，如果可以找出索引 i+1 < j 且满足 (A[0] + A[1] + … + A[i] == A[i+1] + A[i+2] + … + A[j-1] == A[j] + A[j-1] + … + A[A.length - 1]) 就可以将数组三等分。

解题方法

1、求出数组的和 sum
2、遍历，依次找到 sum / 3 --> sum / 3 * 2 这两个节点
note: 注意 sum = 0 的特殊情况

class Solution {
    public boolean canThreePartsEqualSum(int[] A) {
        int sum = 0;
        for (int i = 0; i < A.length; i++) {
            sum += A[i];
        }
        if (sum % 3 != 0) return false;
        int cur = 0;
        boolean first = false;
        for (int i = 0; i < A.length; i++) {
            cur += A[i];
            if (!first && cur == sum / 3) {
                first = true;
                continue;
            }
            if (first && cur == sum / 3 * 2 && i < (A.length - 1)) return true;
        }
        return false;
    }
}

执行用时 : 1 ms, 在所有 Java 提交中击败了 100.00% 的用户
内存消耗 : 45 MB, 在所有 Java 提交中击败了 100.00% 的用户