剑指offer——数组中出现次数超过一半的数字

#include <map>
#include <vector>
using namespace std; 

class Solution {
    public:
        int MoreThanHalfNum_Solution(vector<int> numbers) {
            map<int,int> Map;
            for(int i = 0 ; i < numbers.size() ; i++){
                Map[numbers[i]]++;
            }
            map<int,int>::iterator i;
            int ans = 0;
            for(i = Map.begin() ; i != Map.end() ; i++){
                if(i->second > numbers.size() / 2){
                    ans = i->first;
                }
            }
            return ans;
        }
};