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

#include <unordered_map>
class Solution {
public:
    int MoreThanHalfNum_Solution(vector<int>& numbers) {
        unordered_map<int,int>m;
        int n = numbers.size();
        int x = n/2;
        int sum = 0;
        for(int r = 0;r < n;r++)
        {
            m[numbers[r]]++;
            if( m[numbers[r]] > x)
            {
                sum += numbers[r];
                break;
            }
        }
        return sum;
    }
};