LeetCode 517. Super Washing Machines

517. Super Washing Machines

Description
You have n super washing machines on a line. Initially, each washing machine has some dresses or is empty.

For each move, you could choose any m (1 ≤ m ≤ n) washing machines, and pass one dress of each washing machine to one of its adjacent washing machines at the same time .

Given an integer array representing the number of dresses in each washing machine from left to right on the line, you should find the minimum number of moves to make all the washing machines have the same number of dresses. If it is not possible to do it, return -1.

Example1

Input: [1,0,5]

Output: 3

Explanation:
1st move: 1 0 <– 5 => 1 1 4
2nd move: 1 <– 1 <– 4 => 2 1 3
3rd move: 2 1 <– 3 => 2 2 2
Example2

Input: [0,3,0]

Output: 2

Explanation:
1st move: 0 <– 3 0 => 1 2 0
2nd move: 1 2 –> 0 => 1 1 1
Example3

Input: [0,2,0]

Output: -1

Explanation:
It’s impossible to make all the three washing machines have the same number of dresses.

Analysis
这道题的意思就是给出数台洗衣机，数量不同，每次可选定若干台洗衣机向相邻的洗衣机移动一件衣服。
直到达到平衡，若无法达到平衡，则返回-1；
首先看无法达到平衡的情况，其实就是衣服的总数无法被洗衣机数整除。
若衣服总数可以被洗衣机数整除，那么现在我们可以得到平均每台洗衣机得到的衣服数。
做法时，利用每台洗衣机的衣服数量减去平均数量得到当前洗衣机需要移动的衣服数。
同时我们还需要得到这台洗衣机为止需要转移的衣服数，跟前者加起来，则得到需要经过这台洗衣机所需的衣服数。
最后得到最大值就是结果。

Code

class Solution {
public:
    int findMinMoves(vector<int>& machines) {
        int sum = 0;
        int len = machines.size();
        int res = 0;
        int pass_move =0;
        int num;

        for(int i = 0 ; i <len;++i){
            sum += machines[i];
        }

        if(sum%len!=0) return -1;
        else num = sum/len;

        for(int i = 0 ; i<len;++i){
            pass_move += machines[i] - num;
            res = max(max(res,machines[i]-num),abs(pass_move));
        }

        return res;
    }
};