Majority Element

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

class Solution {
public:
    int majorityElement(vector<int>& nums) {
        //if (nums == NULL)
        //return NULL;
        int length = nums.size();
        if(length == 1)
        return nums[0];
        sort(nums.begin(),nums.end());//对数组的处理一般如果先对数组进行排序的话就可以简单很多
        int count = 1;
        for (int i = 0 ;i<length-1;i++)
        {
            if (nums[i]==nums[i+1])
              count++;
            else
              count = 1;
            if(count > length/2)
             return nums[i];
        }
       
       
    }
};