0462-minimum-moves-to-equal-array-elements-ii.adoc

462. Minimum Moves to Equal Array Elements II

{leetcode}/problems/minimum-moves-to-equal-array-elements-ii/[LeetCode - Minimum Moves to Equal Array Elements II^]

Given a non-empty integer array, find the minimum number of moves required to make all array elements equal, where a move is incrementing a selected element by 1 or decrementing a selected element by 1.

You may assume the array’s length is at most 10,000.

Example:

Input:
[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]

没想到这里竟然还可以用上快速排序中的变体：快速选择！

相关问题请看： 215. Kth Largest Element in an Array。

link:{sourcedir}/_0462_MinimumMovesToEqualArrayElementsII.java[role=include]