python-algorithm
leetcode 462. Minimum Moves to Equal Array Elements II
무적김두칠
2022. 6. 30. 13:09
|
1
2
3
4
5
6
7
8
|
from statistics import median
class Solution:
def minMoves2(self, nums: List[int]) -> int:
med=median(nums)
ans=0
for i in nums :
ans+=abs(med-i)
return int(ans)
|
cs |
반응형