Problem Solving/LeetCode
Today's Challenge
fabichoi
2022. 6. 30. 23:45
https://leetcode.com/problems/minimum-moves-to-equal-array-elements-ii/
Minimum Moves to Equal Array Elements II - LeetCode
Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview.
leetcode.com
중간값 하나 잡고 차등분의 총합을 계산하면 됨.
class Solution:
def minMoves2(self, nums: List[int]) -> int:
nums = sorted(nums)
mid_index = len(nums) // 2
res = 0
for num in nums:
res += abs(nums[mid_index] - num)
return res
반응형