结论是m为中位数,简单证明:https://leetcode-cn.com/problems/minimum-moves-to-equal-array-elements-ii/comments/97616
class Solution {
public:
int minMoves2(vector<int>& nums) {
sort(nums.begin(),nums.end());
int n=nums.size();
int m=nums[n/2],sum=0;
for(int i=0;i<n;++i){
sum+=abs(nums[i]-m);
}
return sum;
}
};