js常见数组去重方法

1,newSet方法

<!DOCTYPE html>
<html lang="en">

<head>
    <meta charset="UTF-8">
    <meta http-equiv="X-UA-Compatible" content="IE=edge">
    <meta name="viewport" content="width=device-width, initial-scale=1.0">
    <title>Document</title>
</head>

<body>

</body>
<script>
    let arr = [1, 1, 2, 2, 3, 3,];

    function unique(arr) {

        return Array.from(new Set(arr));

    }

    console.log(unique(arr));// [1, 2, 3]

    console.log([...new Set(arr)]);// [1,2,3]
</script>

</html>

2, 利用数组的indexOf方法去重

<!DOCTYPE html>
<html lang="en">

<head>
    <meta charset="UTF-8">
    <meta http-equiv="X-UA-Compatible" content="IE=edge">
    <meta name="viewport" content="width=device-width, initial-scale=1.0">
    <title>Document</title>
</head>

<body>

</body>
<script>
    let arr = [1, 1, 2, 2, 3, 3,];
    function unique(arr) {
        let arr1 = [];
        for (let i = 0; i < arr.length; i++) {
            if (arr1.indexOf(arr[i]) === -1) {
                arr1.push(arr[i]);
            }
        }
        return arr1;
    }
    console.log(unique(arr));//[1,2,3]
</script>

</html>

3,利用数组的sort方法去重(相邻元素对比法)

<!DOCTYPE html>
<html lang="en">

<head>
    <meta charset="UTF-8">
    <meta http-equiv="X-UA-Compatible" content="IE=edge">
    <meta name="viewport" content="width=device-width, initial-scale=1.0">
    <title>Document</title>
</head>

<body>

</body>
<script>
    let arr = [1, 1, 2, 2, 3, 3,];
    function unique(arr) {
        let arr1 = [];
        arr.sort();
        arr1.push(arr[0]);
        for (let i = 1; i < arr.length; i++) {
            if (arr[i] !== arr[i - 1]) {
                arr1.push(arr[i]);
            }
        }
        return arr1;
    }
    console.log(unique(arr));//[1,2,3]
</script>

</html>

4,利用数组的includes,返回true,false 的特性

<!DOCTYPE html>
<html lang="en">

<head>
    <meta charset="UTF-8">
    <meta http-equiv="X-UA-Compatible" content="IE=edge">
    <meta name="viewport" content="width=device-width, initial-scale=1.0">
    <title>Document</title>
</head>

<body>

</body>
<script>
    let arr = [1, 1, 2, 2, 3, 3,];

    function unique(arr) {
        let arr1 = [];
        for (let i = 0; i < arr.length; i++) {
            if (!arr1.includes(arr[i])) {
                arr1.push(arr[i]);
            }
        }
        return arr1;
    }
    console.log(unique(arr));//[1,2,3]
</script>

</html>

5,filter 方式过滤,第一次出现的索引等于当前索引

<!DOCTYPE html>
<html lang="en">

<head>
    <meta charset="UTF-8">
    <meta http-equiv="X-UA-Compatible" content="IE=edge">
    <meta name="viewport" content="width=device-width, initial-scale=1.0">
    <title>Document</title>
</head>

<body>

</body>
<script>
    let arr = [1, 1, 2, 2, 3, 3,];


    function unique(arr) {
        return arr.filter((item, index) => {
            return arr.indexOf(item, 0) === index;
        });
    }
    console.log(unique(arr));//[1,2,3]

</script>

</html>

6,递归, 数组赋值一个改变一个也改变,要想不改变原数组,需要for 循环赋值

<!DOCTYPE html>
<html lang="en">

<head>
    <meta charset="UTF-8">
    <meta http-equiv="X-UA-Compatible" content="IE=edge">
    <meta name="viewport" content="width=device-width, initial-scale=1.0">
    <title>Document</title>
</head>

<body>

</body>
<script>
    let arr = [1, 1, 2, 2, 3, 3,];



    function unique(arr) {
        let arr1 = [];
        for (let i = 0; i < arr.length; i++) {
            arr1.push(arr[i]);
        }
        arr1.sort();
        let len = arr1.length;
        function loop(index) {
            if (index >= 1) {
                if (arr1[index] === arr1[index - 1]) {
                    arr1.splice(index, 1);
                }
                index--;
                loop(index);
            }
        }
        loop(len - 1);
        return arr1;
    }
    console.log(unique(arr));//[1,2,3]
    // console.log(arr);//[1,1,2,2,3,3]
</script>

</html>

7,使用双重for循环

<!DOCTYPE html>
<html lang="en">

<head>
    <meta charset="UTF-8">
    <meta http-equiv="X-UA-Compatible" content="IE=edge">
    <meta name="viewport" content="width=device-width, initial-scale=1.0">
    <title>Document</title>
</head>

<body>

</body>
<script>
    let arr = [1, 1, 2, 2, 3, 3,];

    function noRepeat(arr) {
        for (var i = 0; i < arr.length - 1; i++) {
            for (var j = i + 1; j < arr.length; j++) {
                if (arr[i] === arr[j]) {
                    arr.splice(j, 1);
                    j--;
                }
            }
        }
        return arr;
    }
    var arr2 = noRepeat(arr);
    console.log(arr2);//[1,2,3]
</script>

</html>

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值