Update minimum-adjacent-swaps-for-k-consecutive-ones.py

Author: kamyu104

Python/minimum-adjacent-swaps-for-k-consecutive-ones.py

@@ -17,6 +17,6 @@ def moves(i, j):
             prefix[i+1] = prefix[i]+idxs[i]
         result = float("inf")
         for i in xrange(len(idxs)-k+1):
-            result = min(result, -moves(i, i+(k+1)//2-1) + moves(i+k//2, i+k-1))  # take each i+k//2 as median, find min dist to median
+            result = min(result, -moves(i, i+k//2-1) + moves(i+(k+1)//2, i+k-1))  # take each i+k//2 as median, find min dist to median
         result -= (k//2)*((k+1)//2)  # rollback extra moves to the expected positions
         return result