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

#include <unordered_map>
class Solution {
public:
    int MoreThanHalfNum_Solution(vector<int> numbers) {

        int n = numbers.size();

        if(n<=2)
            return numbers[0];
        
        unordered_map<int, int> a;
        int ans;
        for(int i=0; i<n; ++i)
        {
            a[numbers[i]]++;

            if(a[numbers[i]]>n/2)
            {
                ans = numbers[i];
                break;
            }
                
        }

        return ans;

    }
};

自己做法 满足要求