zoukankan      html  css  js  c++  java
  • 数组排序去重

    1.数组排序

      升序

            var arr = [1,4,24,21,44,22,24,41,5,7,56,7];
            console.log(arr);//[1, 4, 24, 21, 44, 22, 24, 41, 5, 7, 56, 7]
            var arr2 = [];
            arr.sort(function(x,y){
                return x-y;//升序
            })
            console.log(arr); // [1, 4, 5, 7, 7, 21, 22, 24, 24, 41, 44, 56]

      降序

           arr.sort(function(x,y){
                return y-x;//降序
            })
            console.log(arr);//[56, 44, 41, 24, 24, 22, 21, 7, 7, 5, 4, 1]

    2.数组去重(不排序的)

            var arr = [1,4,24,21,44,22,24,41,5,7,56,7];
            console.log(arr);//[1, 4, 24, 21, 44, 22, 24, 41, 5, 7, 56, 7]
            var arr2 = [];
            for(var i = 0;i<arr.length;i++){
                if (arr2.indexOf(arr[i]) == '-1') {
                    arr2.push(arr[i]);
                }
            }
            console.log(arr2);//  [1, 4, 24, 21, 44, 22, 41, 5, 7, 56]

      排序去重(根据具体是升序还是降序排序)

      

            var arr = [1,4,24,21,44,22,24,41,5,7,56,7];
            console.log(arr);//[1, 4, 24, 21, 44, 22, 24, 41, 5, 7, 56, 7]
            var arr2 = [];
            arr.sort(function(x,y){
                return x-y;//升序
            })
            console.log(arr); // [1, 4, 5, 7, 7, 21, 22, 24, 24, 41, 44, 56]
            for(var i = 0;i<arr.length;i++){
                if (arr2.indexOf(arr[i]) == '-1') {
                    arr2.push(arr[i]);
                }
            }
            console.log(arr2);//  [1, 4, 5, 7, 21, 22, 24, 41, 44, 56]
  • 相关阅读:
    cf1131f 构造+并查集
    多源最短路小结
    bzoj2200拓扑排序+最短路+联通块
    cf478d 线性dp好题
    cf919D 线性dp+拓扑排序
    hiho1460 rmq模板题
    最小标示法模板 poj1509
    JAVA动态代理机制分析guide
    java动态代理(JDK和cglib)
    AOP面向切面编程
  • 原文地址:https://www.cnblogs.com/SunShineM/p/7680906.html
Copyright © 2011-2022 走看看