[leetcode]169.求众数（Majority Element）C++代码实现

1，题目描述

2，题目分析

1，排序

2，比较

3，代码实现

class Solution {
public:
    int majorityElement(vector<int>& nums) {
       if (nums.size() == 1)
	{
		return nums[0];
	}
	int maxIndex = 0;
	int count = 0;
	int value = 0;
	sort(nums.begin(), nums.end()); 
	int numsSize  = nums.size();
	for (int i = 0; i < numsSize - 1; i++)
	{
		count++;
		if (nums[i] != nums[i + 1])
		{
			
			if (count > maxIndex)
			{
				maxIndex = count;
				value = nums[i];
			}
			count = 0;
		}
		
		
	}
	int numss = (numsSize - 1 )/ 2;
	if (maxIndex <= floor(numss))
	{
		return nums[numsSize - 1];
	}
    return value;
        
    }
};