Package g0401_0500.s0462_minimum_moves_to_equal_array_elements_ii

Class Solution

java.lang.Object

g0401_0500.s0462_minimum_moves_to_equal_array_elements_ii.Solution

public class Solution
extends java.lang.Object

462 - Minimum Moves to Equal Array Elements II.

Medium

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.length
• 1 <= nums.length <= 105
• -109 <= nums[i] <= 109

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
int	minMoves2(int[] nums)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

Solution

public Solution()

Method Details

minMoves2

public int minMoves2(int[] nums)