leetcode/problems/src/math/SuperWashingMachines.java at master · KindleBooks66/leetcode · GitHub

History

55 lines (52 loc) · 1.77 KB

Raw

package math;

import java.util.Arrays;

/**

* Created by gouthamvidyapradhan on 30/01/2020 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].

public class SuperWashingMachines {

public static void main(String[] args) {

}

public int findMinMoves(int[] machines) {

long sum = Arrays.stream(machines).asLongStream().sum();

if (((sum / machines.length) < 0) || ((sum % machines.length) != 0)) return -1;

int n = (int) (sum / machines.length);

int count = 0, moves = Integer.MIN_VALUE;

for (int i = 0; i < machines.length; i++) {

count += (machines[i] - n);

moves = Math.max(moves, Math.max(Math.abs(count), (machines[i] - n)));

}

return moves;

}

leetcode/problems/src/math/SuperWashingMachines.java at master · KindleBooks66/leetcode · GitHub

Uh oh!

Expand file tree

Breadcrumbs

SuperWashingMachines.java

Latest commit

History

Breadcrumbs

SuperWashingMachines.java

File metadata and controls