class Solution {
public:
bool canThreePartsEqualSum(vector<int>& A) {
int sum = accumulate(A.begin(), A.end(), 0);
if (sum % 3 != 0) {
return false;
}
int count = 0, subSum = 0;
for (int i = 0; i < A.size(); i ++) {
subSum += A[i];
if (subSum == sum / 3) {
count ++;
subSum = 0;
}
if (count == 3) {
return true;
}
}
return false;
}
};
LeetCode刷题笔记 1013. 将数组分成和相等的三个部分 【数组】
最新推荐文章于 2021-04-29 10:08:32 发布