题解 | #数组中出现次数超过一半的数字#

#include <unordered_map>
class Solution {
public:
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     * 
     * @param numbers int整型vector 
     * @return int整型
     */
    int MoreThanHalfNum_Solution(vector<int>& numbers) {
        // write code here
        map<int, int>m;
        for(int i=0;i<numbers.size();i++){
            if(m.find(numbers[i])!=m.end()){
                m[numbers[i]]++;
            }
            else {
                m.insert(pair<int,int>(numbers[i],1));
            }
        }
        map<int, int>::iterator it = m.begin();
        int num = 0;
        while(it!=m.end()){
            if(it->second>(numbers.size()/2)){
                num = it->first;
                break;
            } 
            it++;
        }
        return num;
    }
};