462. Minimum Moves to Equal Array Elements II
Medium61.5% acceptance221,025 / 359,367 submissions
Asked by 5 companies
Topics
Given 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
Similar Questions
Best Meeting PointHardMinimum Moves to Equal Array ElementsMediumMinimum Operations to Make a Uni-Value GridMediumRemoving Minimum Number of Magic BeansMediumMinimum Cost to Make Array EqualHardMinimum Operations to Make All Array Elements EqualMediumMinimum Cost to Make Array EqualindromicMediumMinimum Operations to Make Subarray Elements EqualMediumMinimum Operations to Make Elements Within K Subarrays EqualHard