(代码题解来源于leetcode,非本人题解)
class Solution {
public:
int majorityElement(vector<int>& nums) {//创建了一个名为counts的哈希表,用于存储元素及其出现次数的键值对;
//键是数组中的元素值,值是该元素出现的次数
unordered_map<int, int> counts;
int majority = 0, cnt = 0;
for (int num: nums) {
++counts[num];
if (counts[num] > cnt) {
majority = num;
cnt = counts[num];
}
}
return majority;
}
};