一、双层循环
var array = [1, 1, "1", "1"];
function unique(array) {
// res用来存储结果
var res = [];
for (var i = 0, arrayLen = array.length; i < arrayLen; i++) {
for (var j = 0, resLen = res.length; j < resLen; j++) {
if (array[i] === res[j]) {
break;
}
}
console.log(j);
// 如果array[i]是唯一的,那么执行完循环,j等于resLen
if (j === resLen) {
res.push(array[i]);
}
}
return res;
}
console.log("双层循环", unique(array)); // [1, "1"]
二、indexOf
var array = [1, 1, "1"];
function unique(array) {
var res = [];
for (var i = 0, len = array.length; i < len; i++) {
var current = array[i];
if (res.indexOf(current) === -1) {
res.push(current);
}
}
return res;
}
console.log(unique(array)); // [1, "1"]
四、 排序后去重
var array = [1, 1, "1"];
function unique(array) {
var res = [];
console.log(array === array.concat())
var sortedArray = array.concat().sort();
var seen;
for (var i = 0, len = sortedArray.length; i < len; i++) {
// 如果是第一个元素或者相邻的元素不相同
if (!i || seen !== sortedArray[i]) {
res.push(sortedArray[i]);
}
// 将前一个数据暂存,在下一次循环中做比较
seen = sortedArray[i];
}
return res;
}
console.log(unique(array));
五、Object 键值对
var array = [1, 2, 1, 1, "1"];
function unique(array) {
var obj = {};
return array.filter(function(item, index, array) {
return obj.hasOwnProperty(typeof item + item)
? false
: (obj[typeof item + item] = true);
});
}
console.log(unique(array)); // [1, 2, "1"]
ES6
var array = [1, 2, 1, 1, '1'];
function unique(array) {
return Array.from(new Set(array));
}
console.log(unique(array)); // [1, 2, "1"]
function unique(array) {
return [...new Set(array)];
}
var unique = (a) => [...new Set(a)]