_1013.java

packagecom.fishercoder.solutions.secondthousand;

publicclass_1013 {
publicstaticclassSolution1 {
publicbooleancanThreePartsEqualSum(int[] A) {
intsum = 0;
for (inti = 0; i < A.length; i++) {
sum += A[i];
 }
if (sum % 3 != 0) {
returnfalse;
 }
intequalSum = sum / 3;
intleft = 0;
intleftSum = 0;
while (left < A.length - 2 && leftSum != equalSum) {
leftSum += A[left++];
 }
if (left > A.length - 2 || leftSum != equalSum) {
returnfalse;
 }

intright = A.length - 1;
intrightSum = 0;
while (right > left && rightSum != equalSum) {
rightSum += A[right--];
 }
if (right < left || rightSum != equalSum) {
returnfalse;
 }
intmiddleSum = 0;
for (inti = left; i <= right; i++) {
middleSum += A[i];
 }
returnmiddleSum == equalSum;
 }
 }
}