class Solution {
public:
vector<int> majorityElement(vector<int>& nums) {
int count=nums.size()/3;
int length=nums.size();
unordered_map<int,int> mp;
for(int i=0;i<length;++i)
{
//mp[nums[i]]++;
mp.insert(pair<int,int>(nums[i],++mp[nums[i]]));
}
vector<int> vec;
/* for(auto &p:mp)
{
if(p.second>count)
{
vec.push_back(p.first);
}
}*/
unordered_map<int,int>::iterator p=mp.begin();
while(p!=mp.end())
{
if(p->second>count)
{
vec.push_back(p->first);
}
++p;
}
return vec;
}
};
lc.299 求众数2
最新推荐文章于 2024-10-08 10:36:00 发布