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].
这是一道比较典型的动态规划题目,具体思路为对每一台机器进行判断,从左向右进行检索,判断需要经过他的衣服的数量。比如,已经有5件衣服需要经过第i台机器进行传递,同时这台机器本身又溢出了2件衣服,那么就需要传递7件衣服,共计7步。然后用一个变量实时记录最大值即可。至于前面说到的能否均分以及判定每台机器溢出的衣服数量则显然可求,直接在代码中体现了。
int findMinMoves(vector<int>& machines) {
int totalDresses = 0, size = machines.size();
for (auto i = 0; i < size; ++i) totalDresses += machines[i];
if (totalDresses % size != 0) return -1;
auto targetDresses = totalDresses / size, totalMoves = 0, ballance = 0;
for (auto i = 0; i < size; ++i) {
ballance += machines[i] - targetDresses;
totalMoves = max(totalMoves, max(machines[i] - targetDresses, abs(ballance)));
}
return totalMoves;
}