最近开始刷leetcode算法啦,但是作为一个研究生转专业保研的宝宝,算法实在渣渣,c++也不是很擅长,就刷一下js的版本吧,答案又少,在这记录下来自己刷过题目的答案吧,但是肯定不是最好的办法
Given two arrays, write a function to compute their intersection.
Example:
Given nums1 = [1, 2, 2, 1]
, nums2 = [2, 2]
, return [2]
.
Note:
- Each element in the result must be unique.
- The result can be in any order.
/**
* @param {number[]} nums1
* @param {number[]} nums2
* @return {number[]}
*/
var intersection = function(nums1, nums2) {
var a = new Set(nums1);
var b = new Set();
for (n of a) {
for (var v of nums2) {
if (v == n) {
b.add(n);
}
}
}
let array = Array.from(b);
return array;
};