我们需要编写一个JavaScript函数,该函数接受具有重复值的数字数组,并返回显示次数超过(n / 2)次的数字,其中n是数组的长度。如果数组中没有这样的元素,我们的函数应该返回false
让我们为该函数编写代码-
const arr = [12, 5, 67, 12, 4, 12, 4, 12, 6, 12, 12]; const arr1 = [3, 565, 7, 23, 87, 23, 3, 65, 1, 3, 6, 7]; const findMajority = arr => { let maxChar = -Infinity, maxCount = 1; // this loop determines the possible candidates for majorityElement for(let i = 0; i < arr.length; i++){ if(maxChar !== arr[i]){ if(maxCount === 1){ maxChar = arr[i]; } 0else { maxCount--; }; } else { maxCount++; }; }; // this loop actually checks for the candidate to be the majority element const count = arr.reduce((acc, val) => maxChar===val ? ++acc : acc, 0); return count > arr.length / 2; }; console.log(findMajority(arr)); console.log(findMajority(arr1));
输出结果
控制台中的输出将为-
true false