描述
找出出现次数大于n / 2 的数
解决
class Solution {
public:
int majorityElement(vector<int>& nums) {
int lenth = nums.size();
unordered_map<int, int> cnt;
for (int i = 0; i < lenth; ++i){
++cnt[nums[i]];
}
int res = 0;
for (auto& it : cnt)
{
if (it.second > lenth / 2)
res = it.first;
}
return res;
}
};