// 给定数组,写出代码去重
let attr = [1,2,5,6,4,2,8,9,3,8];
let newattr = [];
for(i of attr) {
if(newattr.indexOf(i) == -1) {
newattr.push(i);
}
}
console.log(newattr);
const arr = [1,3,5,6,3,2,7,8,6];
function dyx(arr) {
let aaa = new Set(arr);
return [...aaa];
}
console.log(dyx(arr));
简短一点如下
var arr = [1,3,5,6,3,2,7,8,6];
var newarr = new Set(arr);
console.log(...newattr);//[1 3 5 6 2 7 8];
var arr = [1,3,5,6,3,2,7,8,6];
var newarr = sort(arr);
//sort默认的排序顺序是在将元素转换为字符串,然后比较他们的UTF-16代码的单元之序列时构建的
for(var i = 0; i < newarr.length; i++) {
if(newarr[i] == newarr[i+1]) {
newarr.splice(i,1);
i--;
}
}
console.log(newarr);
// filter
let attr = [1,2,5,6,4,2,8,9,3,8];
let newattr= [];
newattr= attr.filter(function(i,index) {
return attr.indexOf(i) == index;
})
console.log(newattr);
因篇幅问题不能全部显示,请点此查看更多更全内容