2270_NumberofWaystoSplitArray - a920604a/leetcode GitHub Wiki

class Solution {
public:
    int waysToSplitArray(vector<int>& nums) {
        int count = 0, n=nums.size();
        long long cur = 0, total = 0;
        for(int n:nums) total+=n;
        for(int i=0;i<n-1;++i){
            cur+=nums[i];
            total-=nums[i];
            if(cur>=total) count++;
        }
        return count;
    }
};