2.8 KiB
2.8 KiB
id | title | challengeType | videoUrl | localeTitle |
---|---|---|---|---|
587d8253367417b2b2512c6c | Perform a Union on Two Sets | 1 | 在两个集上执行联合 |
Description
Set
数据结构上创建一个名为union
。此方法应将另一个Set
作为参数,并返回两个集合的union
集,不包括任何重复值。例如,如果setA = ['a','b','c']
和setB = ['a','b','d','e']
,则setA和setB的并集为: setA.union(setB) = ['a', 'b', 'c', 'd', 'e']
。 Instructions
Tests
tests:
- text: 你的<code>Set</code>类应该有一个<code>union</code>方法。
testString: 'assert((function(){var test = new Set(); return (typeof test.union === "function")})(), "Your <code>Set</code> class should have a <code>union</code> method.");'
- text: 收回了适当的收藏
testString: 'assert((function(){var setA = new Set(); var setB = new Set(); setA.add("a"); setA.add("b"); setA.add("c"); setB.add("c"); setB.add("d"); var unionSetAB = setA.union(setB); var final = unionSetAB.values(); return (final.indexOf("a") !== -1 && final.indexOf("b") !== -1 && final.indexOf("c") !== -1 && final.indexOf("d") !== -1 && final.length === 4)})(), "The proper collection was returned");'
Challenge Seed
function Set() {
// the var collection will hold the set
var collection = [];
// this method will check for the presence of an element and return true or false
this.has = function(element) {
return (collection.indexOf(element) !== -1);
};
// this method will return all the values in the set
this.values = function() {
return collection;
};
// this method will add an element to the set
this.add = function(element) {
if(!this.has(element)){
collection.push(element);
return true;
}
return false;
};
// this method will remove an element from a set
this.remove = function(element) {
if(this.has(element)){
var index = collection.indexOf(element);
collection.splice(index,1);
return true;
}
return false;
};
// this method will return the size of the set
this.size = function() {
return collection.length;
};
// change code below this line
// change code above this line
}
Solution
// solution required