- [Math_Medium]462. Minimum Moves
- 462. Minimum Moves to Equal Arra
- 462. Minimum Moves to Equal Arra
- quickselect方法找Medium
- 453. Minimum Moves to Equal Arra
- 453. Minimum Moves to Equal Arra
- 453. Minimum Moves to Equal Arra
- 453. Minimum Moves to Equal Arra
- 453. Minimum Moves to Equal Arra
- 453. Minimum Moves to Equal Arra
class Solution(object):
def minMoves2(self, nums):
"""
:type nums: List[int]
:rtype: int
"""
nums.sort()
mid=len(nums)/2
return sum(nums[mid+len(nums)%2:])-sum(nums[:mid])
网友评论