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

C++:

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

 参考:http://www.cnblogs.com/grandyang/p/6648557.html

相关文章:

  • 2021-06-04
  • 2022-12-23
  • 2022-01-07
  • 2021-10-13
  • 2021-07-27
  • 2021-07-04
  • 2021-11-25
  • 2021-08-26
猜你喜欢
  • 2021-07-07
  • 2021-06-16
  • 2022-12-23
  • 2021-12-08
  • 2021-05-17
  • 2022-12-23
  • 2021-07-22
相关资源
相似解决方案