169. Majority Element（LeetCode）

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.

我也想到了很多方法，最终用贪心法实现，其实使用map也是挺简单的，有心人可以查一查

class Solution {
public:
    int majorityElement(vector<int>& nums) {
      int len = nums.size();
        sort(nums.begin(), nums.end());
         if (nums.front() == nums.back())
            return nums[0];
            
        int count1=0;
        int count2=0;
        int num = nums[0];
        int num1=0;
        for (int i = 0; i < len; i++)
        {
            
            if (num == nums[i])
            {
                count1++;
            }
            else
            {

                if (count1>count2)
                {
                    count2 = count1;
                    num1 = num;
                }
                num = nums[i];
                count1 = 1;
            }

        }
        if(count1>count2)
        return num;
        else
        return num1;
    }
};