点击打开链接
class Solution {
public:
int minMoves2(vector<int>& nums) {
sort(nums.begin(), nums.end());
int i = 0, j = nums.size()-1;
int sum = 0;
while (i<j) {
sum += nums[j--] - nums[i++];
}
return sum;
}
};
![](https://i-blog.csdnimg.cn/blog_migrate/e797815d852e54c94f40031371bf621d.png)