[LeetCode-Algorithms-517] "Super Washing Machines" (2018.1.8-WEEK19)

题目链接：Super Washing Machines

• 
  
• 题目描述：
  

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. 

Note:
The range of n is [1, 10000].
The range of dresses number in a super washing machine is [0, 1e5].

---

(1)思路：首先判断能不能平均。然后要注意很多洗衣机同时向相邻的一个方向传递一件衣物时步数也只算1次。那就只需要变量记录每个位置当前量与平均结果量的差距，负数代表从左移动的步数，正数则是从右移动的步数，绝对值是最少移动步数。如果已经有4件衣服需要经过这台洗衣机进行传递，同时本身又多出了2件衣服，那么就需要传递6件，共计7步。用一个变量实时记录最大值。遍历完数组中所有的元素再求最大值，就可得出真正的最少步数。

(2)代码：

class Solution {
public:
    int findMinMoves(vector<int>& machines) {
        int sum = 0, size = machines.size();
        for (int i = 0; i < size; ++i) 
            sum += machines[i];
        if (sum % size != 0) 
            return -1;                       
        int tar = sum / size, total = 0, bal = 0;
        for (int i = 0; i < size; ++i) {                      
            bal += machines[i] - tar;
            total = max(total, max(machines[i] - tar, abs(bal))); 
        }
        return total;
    }
};

(3)提交结果：