Natural Greedy. Sort the array and pick the medium as target.
class Solution { public: int minMoves2(vector<int>& nums) { int n = nums.size(); if(n == 1) return 0; sort(nums.begin(), nums.end()); int mid = nums[n/2]; int ret = 0; for(auto v : nums) ret += abs(v - mid); return ret; } };
LeetCode "462. Minimum Moves to Equal Array Elements II"
原文：http://www.cnblogs.com/tonix/p/6285332.html