Leetcode (179. Maximum number -sort)

If a+b<b+a, switch a and b, for example: 3 connect 30= 330,30 =303, 330>303, do not swap, and so on.

var largestNumber = function(nums) {
    if(nums.length==1) {return nums.toString()
    }
    for(let i=0; i<nums.length-1; i++){for(let j=0; j<nums.length-i-1; j++){ nums=nums.sort((a,b) = >{
                if(a.toString()+b.toString()<b.toString()+a.toString()){
                  return 1
                }
                else{
                  return -1}}}})if(nums[0] = =0) return '0'
    else return nums.join(' ').toString()
};
Copy the code