Minimum Moves to Equal Array Elements II

Minimum Moves to Equal Array Elements II

把问题想太简单了，以为首先找到中间数= =

class Solution {
public:
    int minMoves2(vector<int>& nums) {
        int total = accumulate(nums.begin(), nums.end(), 0);
        int len = nums.size();
        int final = round(total / len);
        total = 0;
        for (int num : nums) {
            total += abs(num - final);
        }
        return total;
    }
};