Super Washing Machines – LeetCode Solution Java , Python 3, Python 2 , C , C++, Best and Optimal Solutions , All you need.

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 machines representing the number of dresses in each washing machine from left to right on the line, return 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.

Example 1:

Input: machines = [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

Example 2:

Input: machines = [0,3,0]
Output: 2
Explanation:
1st move:    0 <-- 3     0    =>    1     2     0
2nd move:    1     2 --> 0    =>    1     1     1

Example 3:

Input: machines = [0,2,0]
Output: -1
Explanation:
It's impossible to make all three washing machines have the same number of dresses.

Constraints:

• n == machines.length
• 1 <= n <= 104
• 0 <= machines[i] <= 105

C++ Super Washing Machines LeetCode Solution

 int findMinMoves(vector<int>& machines) {
        int total = 0, n = machines.size();
        for (int m : machines)
            total += m;
        if (total % n) return -1;
        int target = total / n, res = 0, toRight = 0;
        for (int m : machines) {
            toRight = m + toRight - target;
            res = max(res, max(abs(toRight), m - target));
        }
        return res;
    }

Java Super Washing Machines LeetCode Solution

 public int findMinMoves(int[] machines) {
        int total = 0, n = machines.length;
        for (int m : machines)
            total += m;
        if (total % n > 0) return -1;
        int target = total / n, res = 0, toRight = 0;
        for (int m : machines) {
            toRight = m + toRight - target;
            res = Math.max(res, Math.max(Math.abs(toRight), m - target));
        }
        return res;
    }
 

Python 3 Super Washing Machines LeetCode Solution

def findMinMoves(self, machines):
        total, n = sum(machines), len(machines)
        if total % n: return -1
        target, res, toRight = total / n, 0, 0
        for m in machines:
            toRight = m + toRight - target
            res = max(res, abs(toRight), m - target)
        return res

Array-1180
String-562
Hash Table-412
Dynamic Programming-390
Math-368
Sorting-264

Greedy-257
Depth-First Search-256
Database-215
Breadth-First Search-200
Tree-195

Binary Search-191
Matrix-176
Binary Tree-160
Two Pointers-151
Bit Manipulation-140

Stack-133
Heap (Priority Queue)-117
Design-116
Graph-108
Simulation-103
Prefix Sum-96

Backtracking-92
Counting-86
Sliding Window-73
Linked List-69
Union Find-66

Ordered Set-48
Monotonic Stack-47
Recursion-43
Trie-41
Binary Search Tree-40
Divide and Conquer-40

Enumeration-39
Bitmask-37
Queue-33
Memoization-32
Topological Sort-31

Geometry-30
Segment Tree-27
Game Theory-24
Hash Function-24
Binary Indexed Tree-21

Interactive-18
Data Stream-17
String Matching-17
Rolling Hash-17
Shortest Path-16

Number Theory-16
Combinatorics-15
Randomized-12
Monotonic Queue-9
Iterator-9
Merge Sort-9

Concurrency-9
Doubly-Linked List-8
Brainteaser-8
Probability and Statistics-7
Quickselect-7

Bucket Sort-6
Suffix Array-6
Minimum Spanning Tree-5
Counting Sort-5
Shell-4

Line Sweep-4
Reservoir Sampling-4
Eulerian Circuit-3
Radix Sort-3

Strongly Connected Componen-t2
Rejection Sampling-2
Biconnected Component-1

Leave a comment below

Related posts:

Super Ugly Number – LeetCode Solution Permutations II – LeetCode Solution Triangle – LeetCode Solution Two Sum II – Input Array Is Sorted – LeetCode Solution Game of Life – LeetCode Solution Combination Sum IV – LeetCode Solution