Documentation Index
Fetch the complete documentation index at: /llms.txt
Use this file to discover all available pages before exploring further.
Tested Python solution for LeetCode 462 with 26 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 462 # by problem number
lcpy gen -s minimum_moves_to_equal_array_elements_ii # by problem name
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.
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]
Input: nums = [1,10,2,9]
Output: 16
class Solution:
# Time: O(n log n)
# Space: O(n)
def min_moves2(self, nums: list[int]) -> int:
nums = sorted(nums)
median = nums[len(nums) // 2]
return sum(abs(num - median) for num in nums)
| Time | Space |
|---|---|
| O(n log n) | O(n) |