message: Update moving-stones-until-consecutive-ii.py
diff: @@ -8,7 +8,7 @@ class Solution(object):
  :rtype: List[int]
  """
  stones.sort()
  - left, min_moves = 0, len(stones)
  + left, min_moves = 0, float("inf")
  max_moves = max(stones[-1]-stones[1], stones[-2]-stones[0]) - (len(stones)-2)
  for right in xrange(len(stones)):
  while stones[right]-stones[left]+1 > len(stones): # find window size <= len(stones)
  