public:
int MoreThanHalfNum_Solution(vector<int> numbers) {
unordered_map<int,int> m1;
int a;
if(numbers.size() / 2 == 1){
a = numbers.size() / 2 + 1;
}else{
a = numbers.size() / 2;
}
for(int i = 0; i < numbers.size(); i++){
m1[numbers[i]]++;
if(m1[numbers[i]] > a){
return numbers[i];
}
}
return 0;
}
};