JavaScript 求两个数组的交集，并集，差集，去重

文章目录
1.差集
2.交集
3.并集
4.去重
a = [1, 2, 3]，b = [2, 4, 5]

1.差集
（a-b 差集：属于a但不属于b的集合）a-b=[1,3],b-a=[4,5]

filter + includes
// 差集

let difference = a.concat(b).filter(v => !a.includes(v) ) 

Set + Array.from

let aSet = new Set(a)
let bSet = new Set(b)
let difference = Array.from(new Set(a.concat(b).filter(v => !aSet.has(v) ))) 

filter + indexOf

var difference = a.filter(function(v){ return b.indexOf(v) === -1 })

2.交集
filter + includes
// 交集

let intersection = a.filter(v => b.includes(v)) // [2]
Set + Array.from
let aSet = new Set(a)
let bSet = new Set(b)
let intersection = Array.from(new Set(a.filter(v => bSet.has(v)))) // [2]

filter + indexOf
// 交集

var intersection = a.filter(function(v){ return b.indexOf(v) > -1 }) // [2]

3.并集
filter + includes

let union = a.concat(b.filter(v => !a.includes(v))) // [1,2,3,4,5]

Set + Array.from

let aSet = new Set(a)
let bSet = new Set(b)
let union = Array.from(new Set(a.concat(b))) // [1,2,3,4,5]

filter + indexOf

var union = a.concat(b.filter(function(v) {return a.indexOf(v) === -1 } )) // [1,2,3,4,5]

4.去重
双层循环，外层循环元素，内层循环时比较值，如果有相同的值则跳过，不相同则push进数组

Array.prototype.distinct = function(){
 var arr = this,
  result = [],
  i,
  j,
  len = arr.length;
 for(i = 0; i < len; i++){
  for(j = i + 1; j < len; j++){
   if(arr[i] === arr[j]){
    j = ++i;
   }
  }
  result.push(arr[i]);
 }
 return result;
}
var arra = [1,2,3,4,4,1,1,2,1,1,1];
arra.distinct();    //返回[3,4,2,1]