ES6 Bandingkan dua array
let difference = arrA.filter(x => !arrB.includes(x));
Adventurous Ant
let difference = arrA.filter(x => !arrB.includes(x));function diffArray(arr1, arr2) {
return arr1
.concat(arr2)
.filter(item => !arr1.includes(item) || !arr2.includes(item));
}Array.prototype.equals = function(arr2) {
return (
this.length === arr2.length &&
this.every((value, index) => value === arr2[index])
);
};
[1, 2, 3].equals([1, 2, 3]); // true
[1, 2, 3].equals([3, 6, 4, 2]); // falsefunction arrayDiff (a1, a2) {
var a = [], diff = [];
for (var i = 0; i < a1.length; i++) {
a[a1[i]] = true;
}
for (var i = 0; i < a2.length; i++) {
if (a[a2[i]]) {
delete a[a2[i]];
} else {
a[a2[i]] = true;
}
}
for (var k in a) {
diff.push(k);
}
return diff;
}
//usage:
console.log(arrayDiff(['red', 'white','green'], [ 'red','white', 'blue']));//["green", "blue"]const a = ['Left', 'Right'];
const b = ['Right', 'Left'];
// true if a and b contain the same values
// false otherwise
const c = a.sort().join(',') === b.sort().join(',');
let arr1 = [1, 4, 7, 4, 2, 3];
let arr2 = [1, 2, 3, 4, 7, 18];
const is_same = arr1.length == arr2.length &&
(arr1.every((currElem)=>{
if(arr2.indexOf(currElem)> -1){
return (currElem == arr2[arr2.indexOf(currElem)]);
}return false
})
)
console.log(is_same)