leetcode517+求出转接中的差值最大

https://leetcode.com/problems/super-washing-machines/description/

class Solution {
public:
    int findMinMoves(vector<int>& machines) {
        long long sum = accumulate(machines.begin(), machines.end(), 0);
        if(sum % machines.size() != 0) return -1;
        int count =0, aver = sum / machines.size(), balance = 0;
        for(int m : machines){
            balance += m-aver;
            count = max(count, max(abs(balance), m-aver));
        }
        return count;
    }
};