zoukankan      html  css  js  c++  java
  • js对数组按顺序排序

    复制代码
    console.log("------默认排序(ASCII字符排序)------");  
    var arr = [1,2,55,12,88];  
    arr.sort();  //ASCII字符代码从小到大排序  
    console.log(arr.toString());  
       
    console.log("------自定义函数排序------");  
    var arr1 = [1,2,55,12,88];  
    arr1.sort(function(a,b){  //自定义函数排序  
        var a1= parseInt(a);  
        var b1= parseInt(b);  
        if(a1<b1){  
            return -1;  
        }else if(a1>b1){  
            return 1;  
        }  
        return 0;  
    });  
    console.log(arr1.toString());  
       
    console.log("------反转数组------");  
    var reArr = arr1.reverse();  //将数组中元素的顺序倒转  
    console.log(reArr.toString());  
       
    console.log("------按年龄正序排序------");  
    var arr2 = [];  
    arr2.push({date:"20130101",name:"lee",age:2});  
    arr2.push({date:"20130101",name:"wang",age:12});  
    arr2.push({date:"20130202",name:"huang",age:30});  
    arr2.push({date:"20130202",name:"keke1",age:14});  
    arr2.push({date:"20130202",name:"keke2",age:31});  
    arr2.push({date:"20130303",name:"keke3",age:56});  
    arr2.push({date:"20130303",name:"keke4",age:22});  
    arr2.push({date:"20130303",name:"keke5",age:32});  
    arr2.sort(function(a,b){  
        if(a.age<b.age){  
            return -1;  
        }else if(a.age>b.age){  
            return 1;  
        }  
        return 0;  
    });  
    for(var i=0;i<arr2.length;i++){  
        console.log(arr2[i].date + ", " + arr2[i].name + ", " + arr2[i].age);  
    }  
       
    console.log("------按date倒序,age正序排序------");  
    arr2.sort(function(a,b){  
        if(a.date<b.date){  
            return 1;  
        }else if(a.date>b.date){  
            return -1;  
        }else{  
            if(a.age<b.age){  
                return -1;  
            }else if(a.age>b.age){  
                return 1;  
            }  
            return 0;  
        }  
    });  
    for(var i=0;i<arr2.length;i++){  
        console.log(arr2[i].date + ", " + arr2[i].name + ", " + arr2[i].age);  
    }
    复制代码
  • 相关阅读:
    SDUT 1570 C 旅行(DFS)
    SDUT 1269 走迷宫(BFS)
    求连通分量个数
    Codeforces Round #237 (Div. 2)
    FZU 2150 Fire Game(BFS)
    HDU 2045 不容易系列之(3)—— LELE的RPG难题(递推)
    LeetCode 155. Min Stack
    【ZZ】终于有人把云计算、大数据和人工智能讲明白了!
    学习笔记之Microsoft Office 365
    【ZZ】技能表合集
  • 原文地址:https://www.cnblogs.com/zhangyubao/p/7016852.html
Copyright © 2011-2022 走看看