Leetcode-229 Majority Element II(求众数 II)

class Solution
{
    public:
        vector<int> majorityElement(vector<int>& nums)
        {
            unordered_map<int,int> mymap;
            vector<int> result;
            for(auto d:nums)
            {
                auto ptr = mymap.find(d);
                if(ptr==mymap.end())
                {
                    mymap[d] = 1;
                }
                else
                {
                    ptr->second ++;
                }
            }
            int least_times = nums.size()/3;
            for(auto p:mymap)
            {
                if(p.second>least_times)
                {
                    result.emplace_back(p.first);
                }
            }
            return result;
        }
};