462. Minimum Moves to Equal Array Elements II

Medium

3.1K

117

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:2Explanation: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 <= 10`

^{5}`-10`

^{9}<= nums[i] <= 10^{9}

Accepted

162.5K

Submissions

270.9K

Acceptance Rate

60.0%

Seen this question in a real interview before?

1/4

Yes

No

Discussion (0)

Related Topics

Copyright ©️ 2023 LeetCode All rights reserved