数组中出现次数超过一半的数字

题目描述

数组中有一个数字出现的次数超过数组长度的一半，请找出这个数字。例如输入一个长度为9的数组{1,2,3,2,2,2,5,4,2}。由于数字2在数组中出现了5次，超过数组长度的一半，因此输出2。如果不存在则输出0。

#include<iostream>
#include<string>
#include<algorithm>
#include<map>
#include<vector>
using namespace std;
class Solution {
public:
    int MoreThanHalfNum_Solution(vector<int> numbers) {
        sort(numbers.begin(), numbers.end());
        int count = 1;
        int c = numbers[0];
        int c1;
        int count1 = 0;
        for (int i = 1; i < numbers.size(); i++)
        {
            if (numbers[i] == c)
            {
                count++;
                
            }
            else
            {
                if (count1 < count)
                {
                    count1 = count;
                    c1 = c;
                }
                count = 1;
                c = numbers[i];
            }
        }
        if (count1 >= (numbers.size() / 2))
            return c1;
        else
            return 0;

    }
};
int main()
{
    vector<int> vet{1,2,3,4,5,6,8,2,3 };
    Solution s;
    cout << s.MoreThanHalfNum_Solution(vet) << endl;
    system("pause");
    return 0;
}