Travis build: 1705
This commit is contained in:
@ -10,13 +10,9 @@ Use `Array.prototype.some()` to check if all distinct values are contained in th
|
||||
Return `false` if the count of any element is greater in the first array than the second one, `true` otherwise.
|
||||
|
||||
```js
|
||||
|
||||
const isContainedIn = (a, b) => {
|
||||
for (const v of new Set(a)) {
|
||||
if (
|
||||
!b.some(e => e === v) ||
|
||||
a.filter(e => e === v).length > b.filter(e => e === v).length
|
||||
)
|
||||
if (!b.some(e => e === v) || a.filter(e => e === v).length > b.filter(e => e === v).length)
|
||||
return false;
|
||||
}
|
||||
return true;
|
||||
|
||||
Reference in New Issue
Block a user