js、ES6数组去重

数组去重的方式

提示：reduce，Array.from(new Set(array))，扩展运算符 …，map方法等

reduce去重

// 数组对象去重
let obj = {};
let arr = [
	{id:'1',name:'测试1',},
	{id:'2',name:'测试2',},
	{id:'3',name:'测试3',},
	{id:'1',name:'测试1',},
]
arr = arr.reduce((pre,next) => {
    obj[next.id] ? "" : obj[next.id] = true && pre.push(next);
    return pre;
},[])
//结果arr = [
	{id:'1',name:'测试1',},
	{id:'2',name:'测试2',},
	{id:'3',name:'测试3',},
]

---

es6 array.from(new Set(arr))去重

let arr = [1,2,3,2,35,6,'A','B','L','M','A','A'];
let arrCopy = [];
arrCopy = Array.from(new Set(arr));
//结果 [1, 2, 3, 35, 6, 'A', 'B', 'L', 'M']

---

扩展运算符 … 和Set 结合去重

let arr = [1,2,3,2,35,6,'A','B','L','M','A','A'];
let arrCopy = [];
arrCopy = [...new Set(arr)];
//结果 [1, 2, 3, 35, 6, 'A', 'B', 'L', 'M']

---

map 去重

let arr = [1,2,3,2,35,6,'A','B','L','M','A','A'];
let mapFun = new Map();
let arrCopy = [];
//通过for循环的方式
// for (let i = 0; i < arr.length; i++) {
//     if (mapFun.has(arr[i])) {
//         mapFun.set(arr[i], true)
//     } else {
//         mapFun.set(arr[i], false)
//         arrCopy.push(arr[i])
//     }
// }
//通过 filter 的方式
arrCopy = arr.filter((a) => !mapFun.has(a) && mapFun.set(a, 1))


//结果 [1, 2, 3, 35, 6, 'A', 'B', 'L', 'M']

// 函数封装
let arr = [1,2,3,2,35,6,'A','B','L','M','A','A'];
function deduplicationMap(arr) {
	let mapFun = new Map();
	let arrCopy = [];
	//通过for循环的方式
	// for (let i = 0; i < arr.length; i++) {
	//     if (mapFun.has(arr[i])) {
	//         mapFun.set(arr[i], true)
	//     } else {
	//         mapFun.set(arr[i], false)
	//         arrCopy.push(arr[i])
	//     }
	// }
	//通过 filter 的方式
	arrCopy = arr.filter((a) => !mapFun.has(a) && mapFun.set(a, 1))
	return arrCopy
}
//结果 [1, 2, 3, 35, 6, 'A', 'B', 'L', 'M']

如有不当之处，欢迎留言指正