[剑指Offer] 28.数组中出现次数超过一半的数字

1 class Solution
2 {
3 public:
4     int MoreThanHalfNum_Solution(vector<int> numbers)
5     {
6         if(numbers.size() == 1)
7             return numbers[0];
8         int x = numbers.size()/2;
9         map<int,int> Map;
10         for(int i = 0; i < numbers.size(); i ++)
11         {
12             if(Map.find(numbers[i]) == Map.end())
13             {
14                 Map.insert(pair<int,int>(numbers[i],0));
15             }
16             else
17             {
18                 Map[numbers[i]] ++;
19                 if(Map[numbers[i]] >= x)
20                     return numbers[i];
21             }
22         }
23         return 0;
24     }
25 };