Method One: The most common practice
Use ES5 syntax to achieve, although it will trouble some, but the best compatibility, regardless of browser JavaScript version. Do not introduce other third-party libraries.
1, directly filter, concat calculated
var
a = [1,2,3,4,5]
var
b = [2,4,6,8,10]
//交集
var
c = a.filter(
function
(v){
return
b.indexOf(v) > -1 })
//差集
var
d = a.filter(
function
(v){
return
b.indexOf(v) == -1 })
//补集
var
e = a.filter(
function
(v){
return
!(b.indexOf(v) > -1) })
.concat(b.filter(
function
(v){
return
!(a.indexOf(v) > -1)}))
//并集
var
f = a.concat(b.filter(
function
(v){
return
!(a.indexOf(v) > -1)}));
console.log(
"数组a："
, a);
console.log(
"数组b："
, b);
console.log(
"a与b的交集："
, c);
console.log(
"a与b的差集："
, d);
console.log(
"a与b的补集："
, e);
console.log(
"a与b的并集："
, f);
2, to expand Array
(1) For ease of use, we can extend the array function, add some commonly used methods.
//数组功能扩展
//数组迭代函数
Array.prototype.each =
function
(fn){
fn = fn || Function.K;
var
a = [];
var
args = Array.prototype.slice.call(arguments, 1);
for
(
var
i = 0; i <
this
.length; i++){
var
res = fn.apply(
this
,[
this
[i],i].concat(args));
if
(res !=
null
) a.push(res);
}
return
a;
};
//数组是否包含指定元素
Array.prototype.contains =
function
(suArr){
for
(
var
i = 0; i <
this
.length; i ++){
if
(
this
[i] == suArr){
return
true
;
}
}
return
false
;
}
//不重复元素构成的数组
Array.prototype.uniquelize =
function
(){
var
ra =
new
Array();
for
(
var
i = 0; i <
this
.length; i ++){
if
(!ra.contains(
this
[i])){
ra.push(
this
[i]);
}
}
return
ra;
};
//两个数组的交集
Array.intersect =
function
(a, b){
return
a.uniquelize().each(
function
(o){
return
b.contains(o) ? o :
null
});
};
//两个数组的差集
Array.minus =
function
(a, b){
return
a.uniquelize().each(
function
(o){
return
b.contains(o) ?
null
: o});
};
//两个数组的补集
Array.complement =
function
(a, b){
return
Array.minus(Array.union(a, b),Array.intersect(a, b));
};
//两个数组并集
Array.union =
function
(a, b){
return
a.concat(b).uniquelize();
};
(2) Sample
var
a = [1,2,3,4,5]
var
b = [2,4,6,8,10]
console.log(
"数组a："
, a);
console.log(
"数组b："
, b);
console.log(
"a与b的交集："
, Array.intersect(a, b));
console.log(
"a与b的差集："
, Array.minus(a, b));
console.log(
"a与b的补集："
, Array.complement(a, b));
console.log(
"a与b的并集："
, Array.union(a, b));
Method Two: Use ES6 syntax to achieve
1. The principle
In ES6 we can make use of the extended operator (...) and Set properties to achieve the relevant calculations, the code will be more simple.
2, sample code
var
a = [1,2,3,4,5]
var
b = [2,4,6,8,10]
console.log(
"数组a："
, a);
console.log(
"数组b："
, b);
var
sa =
new
Set(a);
var
sb =
new
Set(b);
// 交集
let intersect = a.filter(x => sb.has(x));
// 差集
let minus = a.filter(x => !sb.has(x));
// 补集
let complement = [...a.filter(x => !sb.has(x)), ...b.filter(x => !sa.has(x))];
// 并集
let unionSet = Array.from(
new
Set([...a, ...b]));
console.log(
"a与b的交集："
, intersect);
console.log(
"a与b的差集："
, minus);
console.log(
"a与b的补集："
, complement);
console.log(
"a与b的并集："
, unionSet);
Method three: Use jQuery to achieve
If you have introduced jQuery project, then realize it is also very simple.
var
a = [1,2,3,4,5]
var
b = [2,4,6,8,10]
console.log(
"数组a："
, a);
console.log(
"数组b："
, b);
// 交集
let intersect = $(a).filter(b).toArray();
// 差集
let minus = $(a).not(b).toArray();
// 补集
let complement = $(a).not(b).toArray().concat($(b).not(a).toArray());
// 并集
let unionSet = $.unique(a.concat(b));
console.log(
"a与b的交集："
, intersect);
console.log(
"a与b的差集："
, minus);
console.log(
"a与b的补集："
, complement);
console.log(
"a与b的并集："
, unionSet);
Transfer from: http: //www.hangge.com/blog/cache/detail_1862.html
1, directly filter, concat calculated
|
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
|
var
a = [1,2,3,4,5]
var
b = [2,4,6,8,10]
//交集
var
c = a.filter(
function
(v){
return
b.indexOf(v) > -1 })
//差集
var
d = a.filter(
function
(v){
return
b.indexOf(v) == -1 })
//补集
var
e = a.filter(
function
(v){
return
!(b.indexOf(v) > -1) })
.concat(b.filter(
function
(v){
return
!(a.indexOf(v) > -1)}))
//并集
var
f = a.concat(b.filter(
function
(v){
return
!(a.indexOf(v) > -1)}));
console.log(
"数组a："
, a);
console.log(
"数组b："
, b);
console.log(
"a与b的交集："
, c);
console.log(
"a与b的差集："
, d);
console.log(
"a与b的补集："
, e);
console.log(
"a与b的并集："
, f);
|
2, to expand Array
(1) For ease of use, we can extend the array function, add some commonly used methods.|
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
|
//数组功能扩展
//数组迭代函数
Array.prototype.each =
function
(fn){
fn = fn || Function.K;
var
a = [];
var
args = Array.prototype.slice.call(arguments, 1);
for
(
var
i = 0; i <
this
.length; i++){
var
res = fn.apply(
this
,[
this
[i],i].concat(args));
if
(res !=
null
) a.push(res);
}
return
a;
};
//数组是否包含指定元素
Array.prototype.contains =
function
(suArr){
for
(
var
i = 0; i <
this
.length; i ++){
if
(
this
[i] == suArr){
return
true
;
}
}
return
false
;
}
//不重复元素构成的数组
Array.prototype.uniquelize =
function
(){
var
ra =
new
Array();
for
(
var
i = 0; i <
this
.length; i ++){
if
(!ra.contains(
this
[i])){
ra.push(
this
[i]);
}
}
return
ra;
};
//两个数组的交集
Array.intersect =
function
(a, b){
return
a.uniquelize().each(
function
(o){
return
b.contains(o) ? o :
null
});
};
//两个数组的差集
Array.minus =
function
(a, b){
return
a.uniquelize().each(
function
(o){
return
b.contains(o) ?
null
: o});
};
//两个数组的补集
Array.complement =
function
(a, b){
return
Array.minus(Array.union(a, b),Array.intersect(a, b));
};
//两个数组并集
Array.union =
function
(a, b){
return
a.concat(b).uniquelize();
};
|
(2) Sample
|
1
2
3
4
5
6
7
8
|
var
a = [1,2,3,4,5]
var
b = [2,4,6,8,10]
console.log(
"数组a："
, a);
console.log(
"数组b："
, b);
console.log(
"a与b的交集："
, Array.intersect(a, b));
console.log(
"a与b的差集："
, Array.minus(a, b));
console.log(
"a与b的补集："
, Array.complement(a, b));
console.log(
"a与b的并集："
, Array.union(a, b));
|
(3) operating results same as above.
Method Two: Use ES6 syntax to achieve
1. The principle
In ES6 we can make use of the extended operator (...) and Set properties to achieve the relevant calculations, the code will be more simple.2, sample code
|
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
|
var
a = [1,2,3,4,5]
var
b = [2,4,6,8,10]
console.log(
"数组a："
, a);
console.log(
"数组b："
, b);
var
sa =
new
Set(a);
var
sb =
new
Set(b);
// 交集
let intersect = a.filter(x => sb.has(x));
// 差集
let minus = a.filter(x => !sb.has(x));
// 补集
let complement = [...a.filter(x => !sb.has(x)), ...b.filter(x => !sa.has(x))];
// 并集
let unionSet = Array.from(
new
Set([...a, ...b]));
console.log(
"a与b的交集："
, intersect);
console.log(
"a与b的差集："
, minus);
console.log(
"a与b的补集："
, complement);
console.log(
"a与b的并集："
, unionSet);
|
Method three: Use jQuery to achieve
If you have introduced jQuery project, then realize it is also very simple.
|
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
|
var
a = [1,2,3,4,5]
var
b = [2,4,6,8,10]
console.log(
"数组a："
, a);
console.log(
"数组b："
, b);
// 交集
let intersect = $(a).filter(b).toArray();
// 差集
let minus = $(a).not(b).toArray();
// 补集
let complement = $(a).not(b).toArray().concat($(b).not(a).toArray());
// 并集
let unionSet = $.unique(a.concat(b));
console.log(
"a与b的交集："
, intersect);
console.log(
"a与b的差集："
, minus);
console.log(
"a与b的补集："
, complement);
console.log(
"a与b的并集："
, unionSet);
|
