#462
Minimum Moves to Equal Array Elements II
specialist · 685 · lc medium +30 · verified · 61.5% accepted · 3,516 likes · top 62%
Description
Given an integer array nums of size n, each operation increments or decrements a single element by 1. Return the minimum total operations required to make all elements equal. The answer fits 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
Code
1
2
3