链接地址:https://leetcode-cn.com/problems/partition-array-into-three-parts-with-equal-sum/
for(int num:A){
sum+=num;
}//这里用到了foreach语句可以去看我的数组补充内容 https://blog.csdn.net/f1244313823/article/details/104464640
class Solution1013 {
public boolean canThreePartsEqualSum(int[] A) {
int sum=0;
for(int num:A){
sum+=num;
}//这里用到了foreach语句用来求和可以去看我的数组补充内容
int key=sum/3;
int group=0;
for(int i=0;i<A.length;i++){
key-=A[i];
if(key==0){
group++;
key=sum/3;
}
}
return group==3;
}
}