Js实现两个数组的差集

//方法一：
var arr1 = [1];
var arr2 = [1, 2]
Array.prototype.diff = function(a) {
    return this.filter(function(i) { return a.indexOf(i) < 0; });
};
console.log([1, 2].diff([1])); //[2]
//方法二：
var isNaN = Number.isNaN;
var difference = function(arr1, arr2) {
    return arr1.reduce(function(previous, i) {
        var found = arr2.findIndex(function(j) {
            return j === i || (isNaN(i) && isNaN(j));
        });
        return (found < 0 && previous.push(i), previous);
    }, []);
};


var arr1 = [1];
var arr2 = [1, 2];

console.log(difference(arr2, arr1)); //[ 2 ]
//方法三：
// ES6 的 Set 来处理，这是真正按照数学上的集合来进行的，不会有重复元素
var subSet = function(arr1, arr2) {
    var set1 = new Set(arr1);
    var set2 = new Set(arr2);

    var subset = [];

    for (let item of set1) {
        if (!set2.has(item)) {
            subset.push(item);
        }