<!DOCTYPE html>
<html lang="en">
<head>
<meta charset="UTF-8">
<meta name="viewport" content="width=device-width, initial-scale=1.0">
<title>Document</title>
</head>
<body>
</body>
<script>
let arr = [1,2,3,4,5,6,7,7,7,7,7,7,8]
let arr2 = [...new Set(arr)]
let arr1 = [1,2,3,7]
function unique(arr2,arr1) {
const soult = []
for(const x of arr2) {
if (arr1.indexOf(x) > -1) {
soult.push(x)
}
}
return soult
}
console.log(unique(arr2,arr1)); // => [ 1, 2, 3, 4, 5, 6, 7 ]
</script>
<script>
let a = [1, 2, 3, 6];
let b = [2, 4, 5, 6];
// 并集
let union = a.concat(b.filter(v => !a.includes(v))) // [1,2,3,4,5]
// 交集
let intersection = a.filter(v => b.includes(v)) // [2]
// 差集
let difference = a.concat(b).filter(v => !a.includes(v) || !b.includes(v)) // [1,3,4,5]
console.log(intersection)
console.log(difference)
</script>
</html>
数组交集 和并集 差集
最新推荐文章于 2024-05-18 14:22:35 发布