使用 es5 语法来实现虽然会麻烦些,但兼容性最好,不用考虑浏览器 javascript 版本。也不用引入其他第三方库。
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);
(1)为方便使用,我们可以对数组功能进行扩展,增加一些常用的方法。
//数组功能扩展
//数组迭代函数
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)使用样例
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));
而在 es6 中我们可以借助扩展运算符(...)以及 set 的特性实现相关计算,代码也会更加简单些。
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);
如果项目中有引入 jquery,那么实现起来也很简单。
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);
转自:http://www.hangge.com/blog/cache/detail_1862.html
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); |
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(); }; |
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)); |
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); |
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); |
原文出自: 转载请保留原文链接:
如对本文有疑问, 点击进行留言回复!!
使用纯前端JavaScript实现Excel导入导出方法过程详解
微信小程序完美解决scroll-view高度自适应问题的方法
网友评论