169. Majority Element

 

169. Majority Element

 HashMap

code

class Solution {
public:
    int majorityElement(vector<int>& nums) {
        unordered_map<int, int> counts;
        for(int i=0; i<nums.size(); i++)
        {
            counts[nums[i]]++;
            if( (counts[nums[i]]) > nums.size()/2) return nums[i];//err
        }
    }
};

1. Leetcode_Majority Element;