LeetCode 솔루션 분류
[6/30] 462. Minimum Moves to Equal Array Elements II
본문
Medium
180082Add to ListShareGiven an integer array nums of size n, return the minimum number of moves required to make all array elements equal.
In one move, you can increment or decrement an element of the array by 1.
Test cases are designed so that the answer will fit in a 32-bit integer.
Example 1:
Input: nums = [1,2,3] Output: 2 Explanation: Only two moves are needed (remember each move increments or decrements one element): [1,2,3] => [2,2,3] => [2,2,2]
Example 2:
Input: nums = [1,10,2,9] Output: 16
Constraints:
n == nums.length1 <= nums.length <= 105-109 <= nums[i] <= 109
관련자료
-
링크
댓글 1
학부유학생님의 댓글
- 익명
- 작성일
class Solution:
def minMoves2(self, nums: List[int]) -> int:
median = sorted(nums)[len(nums)//2]
return sum(abs(num - median) for num in nums)
