blocks|key|1018046|text|var+z+=+$.grep(y,+function(el){return+$.inArray(el,+x)+==+-1});+|type|code-block|depth|inlineStyleRanges|entityRanges|data|syntax|javascript|1018047|此外，该方法的名称太短，不利于其自身的好处。我希望它指的是isElementInArray，而不是indexOf。|unstyled|1018048|有关对象的演示，请参阅http://jsfiddle.net/xBDz3/6/|offset|length|1018049|entityMap|0|LINK|mutability|MUTABLE|url|http://jsfiddle.net/xBDz3/6/^0|0|0|B|S|0|0^^$0|@$1|2|3|4|5|6|7|S|8|@]|9|@]|A|$B|C]]|$1|D|3|E|5|F|7|T|8|@]|9|@]|A|$]]|$1|G|3|H|5|F|7|U|8|@]|9|@$I|V|J|W|1|X]]|A|$]]|$1|K|3|-4|5|F|7|Y|8|@]|9|@]|A|$]]]|L|$M|$5|N|O|P|A|$Q|R]]]]

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

Also, that method name is too short for its own good. I would expect it to mean isElementInArray, not indexOf.

For a demo with objects, see <a href="http://jsfiddle.net/xBDz3/6/" rel="noreferrer">http://jsfiddle.net/xBDz3/6/</a>

blocks|key|1018239|text|在ES6中，只需|type|unstyled|depth|inlineStyleRanges|entityRanges|data|1018240|​|1018241|const+a1+=+["a",+"b",+"c",+"t"];
const+a2+=+["d",+"a",+"t",+"e",+"g"];

console.log(+a2.filter(x+=>+!a1.includes(x))+);|code-block|syntax|javascript|1018242|1018243|(另一个选项是a2.filter(x+=>+a1.indexOf(x)===-1)+)|offset|length|style|CODE|1018244|entityMap^0|0|0|0|0|7|Y|0^^$0|@$1|2|3|4|5|6|7|R|8|@]|9|@]|A|$]]|$1|B|3|C|5|6|7|S|8|@]|9|@]|A|$]]|$1|D|3|E|5|F|7|T|8|@]|9|@]|A|$G|H]]|$1|I|3|C|5|6|7|U|8|@]|9|@]|A|$]]|$1|J|3|K|5|6|7|V|8|@$L|W|M|X|N|O]]|9|@]|A|$]]|$1|P|3|-4|5|6|7|Y|8|@]|9|@]|A|$]]]|Q|$]]

in ES6 simply
<div class="snippet" data-lang="js" data-hide="false" data-console="true" data-babel="false">
<div class="snippet-code">
<pre class="snippet-code-js lang-js prettyprint-override"><code>const a1 = ["a", "b", "c", "t"];
const a2 = ["d", "a", "t", "e", "g"];

console.log( a2.filter(x =&gt; !a1.includes(x)) );</code></pre>
</div>
</div>

(another option is <code>a2.filter(x =&gt; a1.indexOf(x)===-1)</code> )

blocks|key|1232844|text|新的ECMA5+javascript的最新答案：|type|unstyled|depth|inlineStyleRanges|entityRanges|data|1232845|var+x+=+["a","b","c","t"];
var+y+=+["d","a","t","e","g"];

myArray+=+y.filter(+function(+el+)+{
++return+x.indexOf(+el+)+<+0;
});|code-block|syntax|javascript|1232846|entityMap^0|0|0^^$0|@$1|2|3|4|5|6|7|I|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|J|8|@]|9|@]|A|$E|F]]|$1|G|3|-4|5|6|7|K|8|@]|9|@]|A|$]]]|H|$]]

Late answer with the new ECMA5 javascript:

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

myArray = y.filter( function( el ) {
 return x.indexOf( el ) &lt; 0;
});
</code></pre>

blocks|key|1232761|text|这里有一个使用underscore.js的替代方案|type|unstyled|depth|inlineStyleRanges|entityRanges|offset|length|data|1232762|function+inAButNotInB(A,+B)+{
++return+_.filter(A,+function+(a)+{
++++return+!_.contains(B,+a);
++});
}|code-block|syntax|javascript|1232763|entityMap|0|LINK|mutability|MUTABLE|url|http://underscorejs.org/^0|7|D|0|0|0^^$0|@$1|2|3|4|5|6|7|Q|8|@]|9|@$A|R|B|S|1|T]]|C|$]]|$1|D|3|E|5|F|7|U|8|@]|9|@]|C|$G|H]]|$1|I|3|-4|5|6|7|V|8|@]|9|@]|C|$]]]|J|$K|$5|L|M|N|C|$O|P]]]]

Here's an alternative using <a href="http://underscorejs.org/" rel="noreferrer">underscore.js</a>:

<pre><code>function inAButNotInB(A, B) {
 return _.filter(A, function (a) {
 return !_.contains(B, a);
 });
}
</code></pre>

blocks|key|1232965|text|我现在已经很晚了，但也许这会对某些人有帮助。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|1232966|如果数组不只是一个简单的数组，而是一个对象数组，则可以使用以下内容：|1232967|var+arr1+=+[
++++{
++++++"prop1":+"value1",
++++++"prop2":+"value2",
++++},
++++{
++++++"prop1":+"value3",
++++++"prop2":+"value4",
++++},
++++{
++++++"prop1":+"value5",
++++++"prop2":+"value6",
++++},
++];

var+arr2+=+['value1','value3',+'newValue'];

//+finds+all+the+elements+of+arr2+that+are+not+in+arr1
arr2.filter(+
++++val+=>+!arr1.find(+arr1Obj+=>+arr1Obj.prop1+===+val)
);+//+outputs+"newValue"|code-block|syntax|javascript|1232968|entityMap^0|0|0|0^^$0|@$1|2|3|4|5|6|7|K|8|@]|9|@]|A|$]]|$1|B|3|C|5|6|7|L|8|@]|9|@]|A|$]]|$1|D|3|E|5|F|7|M|8|@]|9|@]|A|$G|H]]|$1|I|3|-4|5|6|7|N|8|@]|9|@]|A|$]]]|J|$]]

I am quite late now but maybe it will be helpful for someone.
If the array is not just a simple array but an array of objects then the following can be used:
<pre><code>var arr1 = [
 {
 &quot;prop1&quot;: &quot;value1&quot;,
 &quot;prop2&quot;: &quot;value2&quot;,
 },
 {
 &quot;prop1&quot;: &quot;value3&quot;,
 &quot;prop2&quot;: &quot;value4&quot;,
 },
 {
 &quot;prop1&quot;: &quot;value5&quot;,
 &quot;prop2&quot;: &quot;value6&quot;,
 },
 ];

var arr2 = ['value1','value3', 'newValue'];

// finds all the elements of arr2 that are not in arr1
arr2.filter( 
 val =&gt; !arr1.find( arr1Obj =&gt; arr1Obj.prop1 === val)
); // outputs &quot;newValue&quot;

</code></pre>

blocks|key|1232813|text|这是一个迟来的答案，但它没有使用任何库，因此一些人可能会发现它很有帮助。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|1232814|/**
+*+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%2B%2B)+{
++++var+a2+=+arguments[n];
++++if+(!(a2+instanceof+Array))
++++++throw+new+TypeError(+'argument+['%2Bn%2B']+must+be+Array'+);

++++for(var+i=0;+i<a2.length;+i%2B%2B)+{
++++++var+index+=+a1.indexOf(a2[i]);
++++++if+(index+>+-1)+{
++++++++a1.splice(index,+1);
++++++}+
++++}
++}
++return+a1;
}|code-block|syntax|javascript|1232815|示例：|1232816|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]|1232817|entityMap^0|0|0|0|0^^$0|@$1|2|3|4|5|6|7|M|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|N|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|6|7|O|8|@]|9|@]|A|$]]|$1|I|3|J|5|D|7|P|8|@]|9|@]|A|$E|F]]|$1|K|3|-4|5|6|7|Q|8|@]|9|@]|A|$]]]|L|$]]

This is a late answer, but it uses no libraries so some may find it helpful.

<pre><code>/**
 * 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 &lt; arguments.length; n++) {
 var a2 = arguments[n];
 if (!(a2 instanceof Array))
 throw new TypeError( 'argument ['+n+'] must be Array' );

 for(var i=0; i&lt;a2.length; i++) {
 var index = a1.indexOf(a2[i]);
 if (index &gt; -1) {
 a1.splice(index, 1);
 } 
 }
 }
 return a1;
}
</code></pre>

Example:

<pre><code>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]
</code></pre>

blocks|key|1018087|text|首先制作数组的排序副本。如果顶部元素相等，则将它们都删除。否则，删除较少的元素并将其添加到结果数组中。如果一个数组为空，则将其他数组的其余部分添加到结果中并完成。您可以遍历已排序的数组，而不是移除元素。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|1018088|//+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+%2B=+1;
++++yi+%2B=+1;
++}+else+if+(+x[xi]+<+y[yi]+)+{
++++z.push(+x[xi]+);
++++xi+%2B=+1;
++}+else+{
++++z.push(+y[yi]+);
++++yi+%2B=+1;
++}
}
//+add+remainder+of+x+and+y+to+z.++one+or+both+will+be+empty.|code-block|syntax|javascript|1018089|entityMap^0|0|0^^$0|@$1|2|3|4|5|6|7|I|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|J|8|@]|9|@]|A|$E|F]]|$1|G|3|-4|5|6|7|K|8|@]|9|@]|A|$]]]|H|$]]

Make sorted copies of the arrays first. If the top elements are equal, remove them both. Otherwise remove the element that is less and add it to your result array. If one array is empty, then add the rest of the other array to the result and finish. You can iterate through the sorted arrays instead of removing elements.

<pre><code>// assume x and y are sorted
xi = 0; yi = 0; xc = x.length; yc = y.length;
while ( xi &lt; xc &amp;&amp; yi &lt; yc ) {
 if ( x[xi] == y[yi] ) {
 xi += 1;
 yi += 1;
 } else if ( x[xi] &lt; 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.
</code></pre>

blocks|key|1018133|text|Maybe+jLinq+can+help+you?|type|unstyled|depth|inlineStyleRanges|entityRanges|offset|length|data|1018134|它可以让你对javascript对象运行这样的查询。|1018135|例如：|1018136|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+}+]|code-block|syntax|javascript|1018137|目前它对您来说有点过头了，但这是一个健壮的解决方案，我很高兴了解到这一点。|1018138|它可以做交集，并集，处理布尔逻辑和各种linq风格的好东西。|1018139|entityMap|0|LINK|mutability|MUTABLE|url|http://www.hugoware.net/Projects/jLinq^0|0|P|0|0|0|0|0|0|0^^$0|@$1|2|3|4|5|6|7|Y|8|@]|9|@$A|Z|B|10|1|11]]|C|$]]|$1|D|3|E|5|6|7|12|8|@]|9|@]|C|$]]|$1|F|3|G|5|6|7|13|8|@]|9|@]|C|$]]|$1|H|3|I|5|J|7|14|8|@]|9|@]|C|$K|L]]|$1|M|3|N|5|6|7|15|8|@]|9|@]|C|$]]|$1|O|3|P|5|6|7|16|8|@]|9|@]|C|$]]|$1|Q|3|-4|5|6|7|17|8|@]|9|@]|C|$]]]|R|$S|$5|T|U|V|C|$W|X]]]]

<a href="http://www.hugoware.net/Projects/jLinq" rel="nofollow noreferrer">Maybe jLinq can help you?</a>

It lets you run queries like this against javascript objects.

For example: 

<pre><code>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();

&gt;&gt;&gt; newusers = [ { name: "bob" , age: 30 } ]
</code></pre>

It's a bit overkill for you at the moment, but it's a robust solution that I was glad to learn about.

It can do intersects, unions, handle boolean logic and all kinds of great linq style goodness.

blocks|key|1018256|text|+findDiff+=+(A,+B)+=>+{
+++++return++A.filter(function+(a)+{
++++++++++return+!B.includes(a);
+++++});
+}|type|code-block|depth|inlineStyleRanges|entityRanges|data|syntax|javascript|1018257|unstyled|entityMap^0|0^^$0|@$1|2|3|4|5|6|7|G|8|@]|9|@]|A|$B|C]]|$1|D|3|-4|5|E|7|H|8|@]|9|@]|A|$]]]|F|$]]

<pre><code> findDiff = (A, B) =&gt; {
 return A.filter(function (a) {
 return !B.includes(a);
 });
 }
</code></pre>

I'm looking for a good algorithm to get all the elements in one array that are not elements in another array. So given these arrays:

<pre><code>var x = ["a","b","c","t"];
var ​​​​​​​​​y = [​​​​​​​"d","a","t","e","g"];
</code></pre>

I want to end up with this array:

<pre><code>var z = ["d","e","g"];
</code></pre>

I'm using jquery, so I can take advantage of <code>$.each()</code> and <code>$.inArray()</code>. Here's the solution I've come up with, but it seems like there should be a better way.

<pre><code>// 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"]
</code></pre>

Here is the <a href="http://jsbin.com/axahi3/edit" rel="noreferrer">code in action</a>. Any ideas?

Javascript algorithm to find elements in array that are not in another array

我正在寻找一个好的算法来获得一个数组中的所有元素，而不是另一个数组中的元素。因此，给定这些数组：var x = ["a","b","c","t"];var ​​​​​​​​​y = [​​​​​​​"d","a","t","e","g"];我想用这个数组来结束：var z = ["d","e","g"];我使用的是jquery，所以我可以利用$.each()和$.inArray()。这是我提出的解

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

回答 9

Stack Overflow用户

Stack Overflow用户

Stack Overflow用户

社区

活动

资源

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

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

回答 9

Stack Overflow用户

Stack Overflow用户

Stack Overflow用户

社区

活动

资源

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

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