?LeetCode刷題實戰(zhàn)462：最少移動次數(shù)使數(shù)組元素相等 II
Given an integer array nums of size n, return the minimum number of moves required to make all array elements equal.
In one move, you can increment or decrement an element of the array by 1.
Test cases are designed so that the answer will fit in a 32-bit integer.
示例? ? ? ? ? ? ? ? ? ? ? ? ? ? ?
輸入:
[1,2,3]
輸出:
2
說明：
只有兩個動作是必要的（記得每一步僅可使其中一個元素加1或減1）：
[1,2,3] => [2,2,3] => [2,2,2]
解題
class?Solution?{
public:
????int?minMoves2(vector<int>& nums)?{
????????sort(nums.begin(),nums.end());
????????int?i = 0,j = nums.size() - 1,ans = 0;
????????while(i < j) ans += nums[j--] - nums[i++];
????????return?ans;
????}
};
評論
圖片
表情