参考代码:
class Solution: def movingStones(self, arr): arr = sorted(arr) even = 0 odd = 0 for i in range(0, len(arr)): odd += abs(arr[i] - (2*i + 1)) even += abs(arr[i] - (2*i + 2)) if odd < even: return odd return even