2.9 KiB
2.9 KiB
id | title | challengeType | videoUrl | dashedName |
---|---|---|---|---|
587d8253367417b2b2512c6c | 在两个集上执行联合 | 1 | perform-a-union-on-two-sets |
--description--
在本练习中,我们将对两组数据执行联合。我们将在我们的Set
数据结构上创建一个名为union
。此方法应将另一个Set
作为参数,并返回两个集合的union
集,不包括任何重复值。例如,如果setA = ['a','b','c']
和setB = ['a','b','d','e']
,则setA和setB的并集为: setA.union(setB) = ['a', 'b', 'c', 'd', 'e']
。
--hints--
你的Set
类应该有一个union
方法。
assert(
(function () {
var test = new Set();
return typeof test.union === 'function';
})()
);
收回了适当的收藏
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
);
})()
);
--seed--
--seed-contents--
class Set {
constructor() {
// This will hold the set
this.dictionary = {};
this.length = 0;
}
// This method will check for the presence of an element and return true or false
has(element) {
return this.dictionary[element] !== undefined;
}
// This method will return all the values in the set
values() {
return Object.keys(this.dictionary);
}
// This method will add an element to the set
add(element) {
if (!this.has(element)) {
this.dictionary[element] = true;
this.length++;
return true;
}
return false;
}
// This method will remove an element from a set
remove(element) {
if (this.has(element)) {
delete this.dictionary[element];
this.length--;
return true;
}
return false;
}
// This method will return the size of the set
size() {
return this.length;
}
// Only change code below this line
// Only change code above this line
}
--solutions--
class Set {
constructor() {
this.dictionary = {};
this.length = 0;
}
has(element) {
return this.dictionary[element] !== undefined;
}
values() {
return Object.keys(this.dictionary);
}
add(element) {
if (!this.has(element)) {
this.dictionary[element] = true;
this.length++;
return true;
}
return false;
}
remove(element) {
if (this.has(element)) {
delete this.dictionary[element];
this.length--;
return true;
}
return false;
}
size() {
return this.length;
}
union(set) {
const newSet = new Set();
this.values().forEach(value => {
newSet.add(value);
})
set.values().forEach(value => {
newSet.add(value);
})
return newSet;
}
}