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

class Solution {
public:
    int MoreThanHalfNum_Solution(vector<int> numbers) {
        unordered_map<int,int>hash;
        for(auto x:numbers)
        {
            hash[x]++;
            if(hash[x]>numbers.size()>>1)return x;
        }
        return 0;
    }
};