leetcode 462. Minimum Moves to Equal Array Elements II

最新推荐文章于 2022-09-10 10:59:24 发布

小雨润如酥

最新推荐文章于 2022-09-10 10:59:24 发布

阅读量191

点赞数

分类专栏： leetcode 文章标签： c语言 leetcode

本文链接：https://blog.csdn.net/zhaihaixu/article/details/78192792

版权

leetcode 专栏收录该内容

120 篇文章 1 订阅

订阅专栏

原题：

Given a non-empty integer array, find the minimum number of moves required to make all array elements equal, where a move is incrementing a selected element by 1 or decrementing a selected element by 1.

You may assume the array's length is at most 10,000.

Example:

Input:
[1,2,3]

Output:
2

Explanation:
Only two moves are needed (remember each move increments or decrements one element):

[1,2,3]  =>  [2,2,3]  =>  [2,2,2]

代码如下：

int minMoves2(int* nums, int numsSize) {
    int cmp(const void* a,const void* b)
    {
        return *(int*)a-*(int*)b;
    }
    qsort(nums,numsSize,sizeof(int),cmp);
    int flag;
    if(numsSize%2==0)
    {
        flag=numsSize/2;
    }
    else
    {
        flag=(numsSize+1)/2-1;
    }
    int temp=*(nums+flag);
    int result=0;
    for(int n=0;n<numsSize;n++)
    {
        if(temp>*(nums+n))
        {
            result+=temp-*(nums+n);
        }
        else
        {
            result+=*(nums+n)-temp;
        }
    }
    return result;
}
其实最终的思想是找中位数，然后画一个数轴就很容易证明极致点在哪里了。