题解 | #数组中出现次数超过一半的数字#自己写的hash表
数组中出现次数超过一半的数字
http://www.nowcoder.com/practice/e8a1b01a2df14cb2b228b30ee6a92163
class Solution {
public:
int MoreThanHalfNum_Solution(vector<int> nums) {
unordered_map<int, int> hash;
int n = nums.size();
for(int i = 0;i < n;i++){
if(hash.find(nums[i]) != hash.end()){
hash[nums[i]]++;
}
else{
hash[nums[i]] = 1;
}
if(hash[nums[i]] > n/2){
return nums[i];
}
}
return -1;
}
};
京东方一面23人在聊