We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent d111d87 commit 92c26f7Copy full SHA for 92c26f7
vs-lt/349.两个数组的交集.js
@@ -0,0 +1,26 @@
1
+/*
2
+ * @lc app=leetcode.cn id=349 lang=javascript
3
+ *
4
+ * [349] 两个数组的交集
5
+ */
6
+
7
+// @lc code=start
8
+/**
9
+ * @param {number[]} nums1
10
+ * @param {number[]} nums2
11
+ * @return {number[]}
12
13
+var intersection = function(nums1, nums2) {
14
+ const set = new Set(nums1);
15
+ const resultSet = new Set();
16
17
+ for (let i = 0; i < nums2.length; i++) {
18
+ if (set.has(nums2[i])) {
19
+ resultSet.add(nums2[i]);
20
+ }
21
22
23
+ return Array.from(resultSet);
24
+};
25
+// @lc code=end
26
0 commit comments