Rumah  >  Artikel  >  pembangunan bahagian belakang  >  JavaScript 做了个实验的,学习sort 函数,有错,我也不会改,求改!

JavaScript 做了个实验的,学习sort 函数,有错,我也不会改,求改!

WBOY
WBOYasal
2016-06-06 20:12:54964semak imbas

JavaScript 做了个实验的,学习sort 函数,有错,我也不会改,求改!

<code>var arr3 =new Array("xxxx510","xxxx12","xxxx16","xxxx18","xxxx13","xxxx14","xxxx15","xxxx8","xxxx7","xxxx6","xxxx1","xxxx5",2 );



arr3.sort(Nat123);
console.log(arr3.toString());


function Nat123(a,b)   //自然数升序
{
    var aa=a.replace( "xxxx" , "" );
    var bb=b.replace( "xxxx" , "" );

    if(aa==bb)
    {
        return 0;
    }
    else if(aa>bb)
    {
        return 1;    //1 就是第2个在前;
    }
    else
    {
        return -1;    //-1 就是第1个在前;     
    }
}
</code>

回复内容:

JavaScript 做了个实验的,学习sort 函数,有错,我也不会改,求改!

<code>var arr3 =new Array("xxxx510","xxxx12","xxxx16","xxxx18","xxxx13","xxxx14","xxxx15","xxxx8","xxxx7","xxxx6","xxxx1","xxxx5",2 );



arr3.sort(Nat123);
console.log(arr3.toString());


function Nat123(a,b)   //自然数升序
{
    var aa=a.replace( "xxxx" , "" );
    var bb=b.replace( "xxxx" , "" );

    if(aa==bb)
    {
        return 0;
    }
    else if(aa>bb)
    {
        return 1;    //1 就是第2个在前;
    }
    else
    {
        return -1;    //-1 就是第1个在前;     
    }
}
</code>

<code>function Nat123(a,b)   //自然数升序
{
    var aa = (typeof a === 'string') ? a.replace( "xxxx" , "" ) : a;
    var bb = (typeof b === 'string') ? b.replace( "xxxx" , "" ) : b;

    if(aa==bb)
    {
        return 0;
    }
    else if(aa>bb)
    {
        return 1;    //1 就是第2个在前;
    }
    else
    {
        return -1;    //-1 就是第1个在前;
    }
}
var arr3 =new Array("xxxx510","xxxx12","xxxx16","xxxx18","xxxx13","xxxx14","xxxx15","xxxx8","xxxx7","xxxx6","xxxx1","xxxx5",2 );
arr3.sort(Nat123);
console.log(arr3.toString());</code>

<code>var aa=parseInt(a.replace( "xxxx" , "" ));
var bb=parseInt(b.replace( "xxxx" , "" ));</code>
Kenyataan:
Kandungan artikel ini disumbangkan secara sukarela oleh netizen, dan hak cipta adalah milik pengarang asal. Laman web ini tidak memikul tanggungjawab undang-undang yang sepadan. Jika anda menemui sebarang kandungan yang disyaki plagiarisme atau pelanggaran, sila hubungi admin@php.cn