new_contents: # Time:  O(n)
  # Space: O(1)
  
  # 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].
  
  class Solution(object):
      def findMinMoves(self, machines):
          """
          :type machines: List[int]
          :rtype: int
          """
          total = sum(machines)
          if total % len(machines): return -1
  
          result, target, curr = 0, total / len(machines), 0 
          for n in machines:
              curr += n - target
              result = max(result, max(n - target, abs(curr)))
          return result
  
subject: Create super-washing-machines.py