[leetcode]-169. Majority Element（C语言）

Given an array of size n, find the majority element. The majority element is the element that appears more than ⌊ n/2 ⌋ times.

You may assume that the array is non-empty and the majority element always exist in the array.

Example 1:

Input: [3,2,3]
Output: 3

Example 2:

Input: [2,2,1,1,1,2,2]
Output: 2

void sort(int *nums,int l,int r)
{
    if(l>=r)
        return;
    int i=l,j=r;
    int k=nums[l];
    while(i<j)
    {
        while(i<j&&nums[j]>=k)
            j--;
        if(i<j)
        {
            nums[i]=nums[j];
            i++;
        }
        while(i<j&&nums[i]<k)
            i++;
        if(i<j)
        {
            nums[j]=nums[i];
            j--;
        }
    }
    nums[i]=k;
    sort(nums,l,i-1);
    sort(nums,i+1,r);
}
int majorityElement(int* nums, int numsSize) {
    int i,j,k,n=numsSize/2;
    sort(nums,0,numsSize-1);
    for(i=0;i<numsSize;i++)
    {
        k=1;
        for(j=i+1;j<numsSize;j++)
        {
            if(nums[j]==nums[i])
            {
                k++;
                if(k>n)
                    return nums[i];
            }
            else
                break;
        }
        i=j-1;
    }
    return nums[0];
}