zoukankan      html  css  js  c++  java
  • 数组sort()方法排序

    sort()方法排序

    var arr = ["G","A","C","B","I","H","G","I","B"];
    arr.sort();
    console.log(arr);

    注意:sort函数默认是按照字符顺序排的,隐式将数字转为string(//比字符编码顺序)

    var arr = [23,435,456,23,2,345,2,32,11,324,32,43,65,667,78,43];
    arr.sort();
    console.log(arr);

     

    var arr = [23,435,456,23,2,345,2,32,11,324,32,43,65,667,78,43];
    // 升序
    arr.sort(function(a,b){
        //如果a要放在b前面,那么返回负数
        //如果a要放在b后面,那么返回正数
        //如果a和b不区分大小,那么返回0
        if(a < b){
            return -1;  //满足第一个条件,返回值是-1,a要排在b前面
        }else if(a > b){
            return 1;   //满足第二个条件,返回值是1,a要排在b后面
        }else if(a == b){
            return 0;
        }
    });
    console.log(arr);
    //按五角星的个数排序
    var arr = ["★★★","★★★★★","★★","★★★","★","★★★★★★★★","★★★","★★★★★"];
    arr.sort(function(a,b){
        if(a.length > b.length){
            return -1;  //满足第一个条件,返回值是-1,a要排在b前面
        }else if(a.length < b.length){
            return 1;   //满足第二个条件,返回值是1,a要排在b后面
        }else{
            return 0;
        }
    });
    console.log(arr);
  • 相关阅读:
    接口测试01
    mysql主从
    linux下配置JDK
    linux常用命令
    mysql基本语句
    线程与进程
    loadrunner函数
    设计模式-模板方法模式
    设计原则-CRP合成复用原则
    设计原则-LOD迪米特法则
  • 原文地址:https://www.cnblogs.com/smivico/p/7750342.html
Copyright © 2011-2022 走看看