let a = new Set([1, 2, 3]);
let b = new Set([4, 3, 2]);
// 并集
let union = new Set([...a, ...b]); //Set(4) {1, 2, 3, 4}
// 交集
let intersect = new Set([...a].filter(x => b.has(x))); // Set(2) {2, 3}
// 差集
let difference = new Set([...a].filter(x => !b.has(x)));// Set(1) {1}
求数组的交集-并集-差集
猜你喜欢
转载自blog.csdn.net/Wangdanting123/article/details/85109370
今日推荐
周排行