△
或⊕
)数组。给定两个集合(例如集合A = {1, 2, 3}
并且集合B = {2, 3, 4}
),两个集合的数学术语“对称差异”是在任一集合中的元素集合。两组,但两者都没有( A △ B = C = {1, 4}
)。对于你所采取的每一个额外的对称差异(比如在集合D = {2, 3}
),你应该得到具有两个集合中的任何一个但不是两个集合的元素的集合( C △ D = {1, 4} △ {2, 3} = {1, 2, 3, 4}
)。结果数组必须仅包含唯一值( 不重复 )。如果卡住,请记得使用Read-Search-Ask 。尝试配对程序。编写自己的代码。 sym([1, 2, 3], [5, 2, 1, 4])
应返回[3, 4, 5]
。'
testString: 'assert.sameMembers(sym([1, 2, 3], [5, 2, 1, 4]), [3, 4, 5], "sym([1, 2, 3], [5, 2, 1, 4])
should return [3, 4, 5]
.");'
- text: 'sym([1, 2, 3], [5, 2, 1, 4])
应仅包含三个元素。'
testString: 'assert.equal(sym([1, 2, 3], [5, 2, 1, 4]).length, 3, "sym([1, 2, 3], [5, 2, 1, 4])
should contain only three elements.");'
- text: 'sym([1, 2, 3, 3], [5, 2, 1, 4])
应该返回[3, 4, 5]
。'
testString: 'assert.sameMembers(sym([1, 2, 3, 3], [5, 2, 1, 4]), [3, 4, 5], "sym([1, 2, 3, 3], [5, 2, 1, 4])
should return [3, 4, 5]
.");'
- text: 'sym([1, 2, 3, 3], [5, 2, 1, 4])
应仅包含三个元素。'
testString: 'assert.equal(sym([1, 2, 3, 3], [5, 2, 1, 4]).length, 3, "sym([1, 2, 3, 3], [5, 2, 1, 4])
should contain only three elements.");'
- text: 'sym([1, 2, 3], [5, 2, 1, 4, 5])
应返回[3, 4, 5]
。'
testString: 'assert.sameMembers(sym([1, 2, 3], [5, 2, 1, 4, 5]), [3, 4, 5], "sym([1, 2, 3], [5, 2, 1, 4, 5])
should return [3, 4, 5]
.");'
- text: 'sym([1, 2, 3], [5, 2, 1, 4, 5])
应仅包含三个元素。'
testString: 'assert.equal(sym([1, 2, 3], [5, 2, 1, 4, 5]).length, 3, "sym([1, 2, 3], [5, 2, 1, 4, 5])
should contain only three elements.");'
- text: 'sym([1, 2, 5], [2, 3, 5], [3, 4, 5])
应该返回[1, 4, 5]
'
testString: 'assert.sameMembers(sym([1, 2, 5], [2, 3, 5], [3, 4, 5]), [1, 4, 5], "sym([1, 2, 5], [2, 3, 5], [3, 4, 5])
should return [1, 4, 5]
");'
- text: 'sym([1, 2, 5], [2, 3, 5], [3, 4, 5])
应仅包含三个元素。'
testString: 'assert.equal(sym([1, 2, 5], [2, 3, 5], [3, 4, 5]).length, 3, "sym([1, 2, 5], [2, 3, 5], [3, 4, 5])
should contain only three elements.");'
- text: 'sym([1, 1, 2, 5], [2, 2, 3, 5], [3, 4, 5, 5])
应该返回[1, 4, 5]
。'
testString: 'assert.sameMembers(sym([1, 1, 2, 5], [2, 2, 3, 5], [3, 4, 5, 5]), [1, 4, 5], "sym([1, 1, 2, 5], [2, 2, 3, 5], [3, 4, 5, 5])
should return [1, 4, 5]
.");'
- text: 'sym([1, 1, 2, 5], [2, 2, 3, 5], [3, 4, 5, 5])
应仅包含三个元素。'
testString: 'assert.equal(sym([1, 1, 2, 5], [2, 2, 3, 5], [3, 4, 5, 5]).length, 3, "sym([1, 1, 2, 5], [2, 2, 3, 5], [3, 4, 5, 5])
should contain only three elements.");'
- text: 'sym([3, 3, 3, 2, 5], [2, 1, 5, 7], [3, 4, 6, 6], [1, 2, 3])
应该返回[2, 3, 4, 6, 7]
sym([3, 3, 3, 2, 5], [2, 1, 5, 7], [3, 4, 6, 6], [1, 2, 3])
[2, 3, 4, 6, 7]
。'
testString: 'assert.sameMembers(sym([3, 3, 3, 2, 5], [2, 1, 5, 7], [3, 4, 6, 6], [1, 2, 3]), [2, 3, 4, 6, 7], "sym([3, 3, 3, 2, 5], [2, 1, 5, 7], [3, 4, 6, 6], [1, 2, 3])
should return [2, 3, 4, 6, 7]
.");'
- text: 'sym([3, 3, 3, 2, 5], [2, 1, 5, 7], [3, 4, 6, 6], [1, 2, 3])
应仅包含五个元素。'
testString: 'assert.equal(sym([3, 3, 3, 2, 5], [2, 1, 5, 7], [3, 4, 6, 6], [1, 2, 3]).length, 5, "sym([3, 3, 3, 2, 5], [2, 1, 5, 7], [3, 4, 6, 6], [1, 2, 3])
should contain only five elements.");'
- text: 'sym([3, 3, 3, 2, 5], [2, 1, 5, 7], [3, 4, 6, 6], [1, 2, 3], [5, 3, 9, 8], [1])
应该返回[1, 2, 4, 5, 6, 7, 8, 9]
。'
testString: 'assert.sameMembers(sym([3, 3, 3, 2, 5], [2, 1, 5, 7], [3, 4, 6, 6], [1, 2, 3], [5, 3, 9, 8], [1]), [1, 2, 4, 5, 6, 7, 8, 9], "sym([3, 3, 3, 2, 5], [2, 1, 5, 7], [3, 4, 6, 6], [1, 2, 3], [5, 3, 9, 8], [1])
should return [1, 2, 4, 5, 6, 7, 8, 9]
.");'
- text: 'sym([3, 3, 3, 2, 5], [2, 1, 5, 7], [3, 4, 6, 6], [1, 2, 3], [5, 3, 9, 8], [1])
应该只包含八个元素。'
testString: 'assert.equal(sym([3, 3, 3, 2, 5], [2, 1, 5, 7], [3, 4, 6, 6], [1, 2, 3], [5, 3, 9, 8], [1]).length, 8, "sym([3, 3, 3, 2, 5], [2, 1, 5, 7], [3, 4, 6, 6], [1, 2, 3], [5, 3, 9, 8], [1])
should contain only eight elements.");'
```