java.lang.Object
g0401_0500.s0462_minimum_moves_to_equal_array_elements_ii.Solution

public class Solution extends Object
462 - Minimum Moves to Equal Array Elements II.<p>Medium</p> <p>Given an integer array <code>nums</code> of size <code>n</code>, return <em>the minimum number of moves required to make all array elements equal</em>.</p> <p>In one move, you can increment or decrement an element of the array by <code>1</code>.</p> <p>Test cases are designed so that the answer will fit in a <strong>32-bit</strong> integer.</p> <p><strong>Example 1:</strong></p> <p><strong>Input:</strong> nums = [1,2,3]</p> <p><strong>Output:</strong> 2</p> <p><strong>Explanation:</strong> Only two moves are needed (remember each move increments or decrements one element): [1,2,3] => [2,2,3] => [2,2,2]</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> nums = [1,10,2,9]</p> <p><strong>Output:</strong> 16</p> <p><strong>Constraints:</strong></p> <ul> <li><code>n == nums.length</code></li> <li><code>1 <= nums.length <= 10<sup>5</sup></code></li> <li><code>-10<sup>9</sup> <= nums[i] <= 10<sup>9</sup></code></li> </ul>
  • Constructor Details

    • Solution

      public Solution()
  • Method Details

    • minMoves2

      public int minMoves2(int[] nums)