JavaScript 做了個實驗的,學習sort 函數,有錯,我也不會改,求改!
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個在前; }}
回複內容:
JavaScript 做了個實驗的,學習sort 函數,有錯,我也不會改,求改!
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個在前; }}
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());
var aa=parseInt(a.replace( "xxxx" , "" ));var bb=parseInt(b.replace( "xxxx" , "" ));