扁平化去重且升序

不用sort方法实现

function addsort(arr){
    var newArr=Array.from(new Set(arr.toString().split(",").map(Number)));
    console.log(newArr)
    var a;
    for(let i=0;i<newArr.length;i++){
        for(let j=i+1;j<newArr.length;j++){
            if(newArr[i]>newArr[j]){
                a=newArr[i];
                newArr[i]=newArr[j];
                newArr[j]=a;
            }
        }
    }
        return newArr;
}

用sort方法实现

function addsort(arr){
    var newArr=Array.from(new Set(arr.toString().split(",").map(Number))).sort((a,b)=>a-b);
        return newArr;
}

纯循环实现

      function bphqc(arr,newArr){
            newArr=newArr?newArr:[];
            /* 降维 */
            arr.forEach(item=>{
                if(!Array.isArray(item)){
                    newArr.push(item)
                }else{
                    bphqc(item,newArr)
                }
            })

            let centenNum=null;
            /* 排序且去重 */
            for(let i=0;i<newArr.length;i++){
                for (let j = i+1; j < newArr.length; j++) {
                    if(newArr[i]>newArr[j]){
                        centenNum=newArr[i];
                        newArr[i]=newArr[j];
                        newArr[j]=centenNum
                    }else if(newArr[i]==newArr[j]){
                        newArr[j]=newArr[j+1];
                        newArr.length=newArr.length-1;
                    }
                }
            }
            return newArr;
        }