题目
解题
解题一:哈希表
// javascript
var majorityElement = function(nums) {
const numMap = new Map();
let majorityCount = -Infinity;
let majorityEle = null;
for (const num of nums) {
numMap.set(num, (numMap.get(num) || 0) + 1);
}
for (const num of numMap.keys()) {
if (numMap.get(num) > majorityCount) {
majorityCount = numMap.get(num);
majorityEle = num;
}
}
return majorityEle;
};
解题二:排序
// javascript
var majorityElement = function(nums) {
nums.sort((a, b) => a - b);
return nums[nums.length >> 1];
};
解题三:分治
// javascript
var majorityElement = function(nums) {
return majorityElementRec(nums, 0, nums.length - 1);
};
const countInRange = (nums, lo, hi, target) => {
let count = 0;
for (let i = lo; i <= hi; i++) {
if (nums[i] === target) {
count++;
}
}
return count;
};
const majorityElementRec = (nums, lo, hi) => {
if (lo === hi) return nums[lo];
const mid = lo + ((hi - lo) >> 1);
const majorityL = majorityElementRec(nums, lo, mid);
const majorityR = majorityElementRec(nums, mid + 1, hi);
if (majorityL === majorityR) return majorityL;
const leftCount = countInRange(nums, lo, hi, majorityL);
const rightCount = countInRange(nums, lo, hi, majorityR);
return leftCount > rightCount ? majorityL : majorityR;
};
主定理:
d = 1, a = 2, b = 2, 满足第二种情况 2 = 2 ^ 1。
解法四:Boyer-Moore 投票算法
参考:剑指 Offer 39. 数组中出现次数超过一半的数字(摩尔投票法,清晰图解)
// javascript
var majorityElement = function(nums) {
let count = 0, candidate = null;
for (const num of nums) {
if (count === 0) candidate = num;
count += (num === candidate) ? 1 : -1;
}
return candidate;
};