用于查找数组中不在另一个数组中的元素的Javascript算法

var x = ["a","b","c","t"];
var y = ["d","a","t","e","g"];

var z = ["d","e","g"];

// goal is to get rid of values in y if they exist in x
var x = ["a","b","c","t"];
var y = ["d","a","t","e","g"];
var z = [];
$.each(y, function(idx, value){
  if ($.inArray(value,x) == -1) {
    z.push(value);
alert(z);  // should be ["d","e","g"]

var z = $.grep(y, function(el){return $.inArray(el, x) == -1});

// assume x and y are sorted
xi = 0; yi = 0; xc = x.length; yc = y.length;
while ( xi < xc && yi < yc ) {
  if ( x[xi] == y[yi] ) {
    xi += 1;
    yi += 1;
  } else if ( x[xi] < y[yi] ) {
    z.push( x[xi] );
    xi += 1;
  } else {
    z.push( y[yi] );
    yi += 1;
// add remainder of x and y to z.  one or both will be empty.

var users = [ { name: "jacob", age: 25 },  { name: "bob" , age: 30 }]
var additionalusers = [ { name: "jacob", age: 25 },  { name: "bill" , age: 25 }]
var newusers = jLinq.from(users).except(additionalusers).select();
>>> newusers = [ { name: "bob" , age: 30 } ]

function inAButNotInB(A, B) {
  return _.filter(A, function (a) {
    return !_.contains(B, a);
}

/**
 * Returns a non-destructive Array of elements that are not found in
 * any of the parameter arrays.
 * @param {...Array} var_args   Arrays to compare.
Array.prototype.uniqueFrom = function() {
  if (!arguments.length)
    return [];
  var a1 = this.slice(0); // Start with a copy
  for (var n=0; n < arguments.length; n++) {
    var a2 = arguments[n];
    if (!(a2 instanceof Array))
      throw new TypeError( 'argument ['+n+'] must be Array' );
    for(var i=0; i<a2.length; i++) {
      var index = a1.indexOf(a2[i]);
      if (index > -1) {
        a1.splice(index, 1);
  return a1;
}

var sheetUsers = ['joe@example.com','fred@example.com','sam@example.com'];
var siteViewers = ['joe@example.com','fred@example.com','lucy@example.com'];
var viewersToAdd = sheetUsers.uniqueFrom(siteViewers);  // [sam@example.com]
var viewersToRemove = siteViewers.uniqueFrom(sheetUsers);  // [lucy@example.com]

var x = ["a","b","c","t"];
var y = ["d","a","t","e","g"];
myArray = y.filter( function( el ) {
  return x.indexOf( el ) < 0;
});

const a1 = ["a", "b", "c", "t"];
const a2 = ["d", "a", "t", "e", "g"];
console.log( a2.filter(x => !a1.includes(x)) );

 findDiff = (A, B) => {
     return  A.filter(function (a) {
          return !B.includes(a);
 }

var arr1 = [
      "prop1": "value1",
      "prop2": "value2",
      "prop1": "value3",
      "prop2": "value4",
      "prop1": "value5",
      "prop2": "value6",

用于查找数组中不在另一个数组中的元素的Javascript算法

9 个回答