2032. 至少在两个数组中出现的值

Author: w2xi

README.md

@@ -175,6 +175,7 @@
 |1780|[判断一个数字是否可以表示成三的幂的和](https://leetcode.cn/problems/check-if-number-is-a-sum-of-powers-of-three/)|[JavaScript](./algorithms/check-if-number-is-a-sum-of-powers-of-three.js)|Medium|
 |1832|[判断句子是否为全字母句](https://leetcode.cn/problems/check-if-the-sentence-is-pangram/)|[JavaScript](./algorithms/check-if-the-sentence-is-pangram.js)|Easy|
 |1945|[字符串转化后的各位数字之和](https://leetcode.cn/problems/sum-of-digits-of-string-after-convert/)|[JavaScript](./algorithms/sum-of-digits-of-string-after-convert.js)|Easy|
+|2032|[至少在两个数组中出现的值](https://leetcode.cn/problems/two-out-of-three/)|[JavaScript](./algorithms/two-out-of-three.js)|Easy|
 |面试题 04.12|[面试题 04.12. 求和路径](https://leetcode.cn/problems/paths-with-sum-lcci/)|[JavaScript](./algorithms/paths-with-sum-lcci.js)|Medium|
 |面试题 02.07|[面试题 02.07. 链表相交](https://leetcode.cn/problems/intersection-of-two-linked-lists-lcci/)|[JavaScript](./algorithms/intersection-of-two-linked-lists-lcci.js)|Easy|
 |剑指 Offer 05. 替换空格|[剑指 Offer 05. 替换空格](https://leetcode.cn/problems/ti-huan-kong-ge-lcof/)|[JavaScript](./algorithms/ti-huan-kong-ge-lcof.js)|Easy|

algorithms/two-out-of-three.js

@@ -0,0 +1,28 @@
+/**
+ * @param {number[]} nums1
+ * @param {number[]} nums2
+ * @param {number[]} nums3
+ * @return {number[]}
+ */
+ var twoOutOfThree = function(nums1, nums2, nums3) {
+  const result = [];
+  const s1 = new Set(nums1);
+  const s2 = new Set(nums2);
+
+  for (let i = 0; i < nums2.length; i++) {
+    if (s1.has(nums2[i])) {
+      result.push(nums2[i]);
+    }
+  }
+  for (let i = 0; i < nums3.length; i++) {
+    if (s1.has(nums3[i])) {
+      result.push(nums3[i]);
+    }
+  }
+  for (let i = 0; i < nums3.length; i++) {
+    if (s2.has(nums3[i])) {
+      result.push(nums3[i]);
+    }
+  }
+  return [...new Set(result)];
+};