05Leetcode每日一题——将数组分成和相等的三个部分
代码
class Solution {
public boolean canThreePartsEqualSum(int[] A) {
int sum = 0;
for(int a : A){
sum += a;
}
if(sum%3!=0){
return false;
}
int aver = sum/3;
sum = 0;
int count = 0;
for(int a : A){
sum+=a;
if(sum==aver){
sum=0;
count++;
}
}
if((count==3&&sum==0)||(count>3&&aver==0)) return true;
else return false;
}
}