查重排序数组&插入排序
let arr = [0,3,0,3,0,3];
for(var i = 0;i<arr.length-1;i++){
for(var j = i+1;j>0 && arr[j] < arr[j-1];j--){
swap(arr,j,j-1);
}
}
function swap(arr,a,b){
var t = arr[a];
arr[a] = arr[b];
arr[b] = t;
}
function test(arr){
var n = arr.length
if(n == 0){
return 0;
}
var index = 1;
for(var i = 1;i<n;i++){
if(arr[i] == arr[i-1]){
continue;
}
arr[index] = arr[i];
index++;
}
return index;
}
function arrayCopy(arr,n){
var newArr = new Array(n);
for(var i = 0;i<n;i++){
newArr[i] = arr[i];
}
return newArr;
}
var n = test(arr);
console.log(arrayCopy(arr,n));
console.log(arr);