freeCodeCamp

3.1 KiB

Raw Blame History

id	title	challengeType	videoUrl	localeTitle
587d8253367417b2b2512c6d	Perform an Intersection on Two Sets of Data	1		在两组数据上执行交集

Description

在本练习中，我们将对两组数据执行交集。我们将在我们的Set数据结构上创建一个名为intersection 。集合的交集表示两个或更多集合共有的所有值。此方法应将另一个Set作为参数，并返回两个集合的intersection 。例如，如果setA = ['a','b','c']和setB = ['a','b','d','e'] ，则setA和setB的交集为： setA.intersection(setB) = ['a', 'b'] 。

Instructions

Tests

tests:
  - text: 您的<code>Set</code>类应该有一个<code>intersection</code>方法。
    testString: 'assert(function(){var test = new Set(); return (typeof test.intersection === "function")}, "Your <code>Set</code> class should have a <code>intersection</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 intersectionSetAB = setA.intersection(setB); return (intersectionSetAB.size() === 1 && intersectionSetAB.values()[0] === "c")}, "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 collection
    this.size = function() {
        return collection.length;
    };
    // this method will return the union of two sets
    this.union = function(otherSet) {
        var unionSet = new Set();
        var firstSet = this.values();
        var secondSet = otherSet.values();
        firstSet.forEach(function(e){
            unionSet.add(e);
        });
        secondSet.forEach(function(e){
            unionSet.add(e);
        });
        return unionSet;
    };
    // change code below this line
    // change code above this line
}

Solution

// solution required

3.1 KiB Raw Blame History Unescape Escape