leetcode 腾讯精选169

题目：https://leetcode-cn.com/problems/majority-element/submissions/
代码：class Solution {
public:
int majorityElement(vector& nums) {

    int size = nums.size();
    if(size == 0)
    {
        return 0;
    }
    sort(nums.begin(),nums.end());
    
    
    
    int maxsize = 0;
    int num;
   for(int i = 0; i < size;)
   {
       int j = i;
       int tmp = 0;
       while(j < size&&nums[j] == nums[i])
       {
           j++;
           tmp++;
       }
       
       if(tmp > maxsize)
       {
           maxsize = tmp;
           num = nums[i];
       }
       
       
       i = j;
   }
    
    return num;
}

};