算法：找出一个数组中出现次数最多的元素

温暖前端

于 2024-02-29 20:55:25 发布

阅读量369

点赞数 3

分类专栏：前端算法文章标签：算法 javascript 前端

本文链接：https://blog.csdn.net/qq_45914628/article/details/136380848

版权

前端算法专栏收录该内容

7 篇文章 0 订阅

订阅专栏

找出一个数组中出现次数最多的元素

使用对象记录元素出现次数：

function findMostFrequentElement(arr) {
    let count = {};
    let maxCount = 0;
    let mostFrequentElement = null;

    arr.forEach(element => {
        count[element] = (count[element] || 0) + 1;
        if (count[element] > maxCount) {
            maxCount = count[element];
            mostFrequentElement = element;
        }
    });

    return mostFrequentElement;
}

const arr = [1, 5, 3, 5, 5, 3, 4, 5, 2];
console.log(findMostFrequentElement(arr)); // 输出: 5

使用Map记录元素出现次数：

function findMostFrequentElement(arr) {
    let count = new Map();
    let maxCount = 0;
    let mostFrequentElement = null;

    arr.forEach(element => {
        count.set(element, (count.get(element) || 0) + 1);
        if (count.get(element) > maxCount) {
            maxCount = count.get(element);
            mostFrequentElement = element;
        }
    });

    return mostFrequentElement;
}

const arr = [1, 2, 3, 2, 2, 3, 4, 5, 2];
console.log(findMostFrequentElement(arr)); // 输出: 2

使用reduce函数结合对象记录元素出现次数：

function findMostFrequentElement(arr) {
    const count = arr.reduce((acc, element) => {
        acc[element] = (acc[element] || 0) + 1;
        return acc;
    }, {});

    let maxCount = 0;
    let mostFrequentElement = null;

    for (const element in count) {
        if (count[element] > maxCount) {
            maxCount = count[element];
            mostFrequentElement = element;
        }
    }

    return mostFrequentElement;
}

const arr = [1, 1, 3, 1, 1, 3, 4, 5, 2];
console.log(findMostFrequentElement(arr)); // 输出: 1