程式語言 - LeetCode - C++ - 462. Minimum Moves to Equal Array Elements II



題目:


解答:

class Solution {
public:
    int minMoves2(vector<int>& nums) {
        int n = nums.size();
        sort(nums.begin(), nums.end());
        int m = nums[n >> 1];
        int ans = 0;

        for (int v : nums) {
            ans += abs(v - m);
        }

        return ans;
    }
};