intersect

Author: liuhanqu

README.md

@@ -13,6 +13,7 @@ LeetCode Problems' Solutions in JavaScript
 7.  [从排序数组中删除重复项](./algorithms/easy/removeDuplicates/removeDuplicates.js)
 8.  [反转整数](./algorithms/easy/reverse/reverse.js)
 9.  [第一个错误的版本](./algorithms/easy/solution/solution.js)
+10. [两个数组的交集 II](./algorithms/easy/intersect/intersect.js)
 
 ## medium
 

algorithms/easy/intersect/intersect.js

@@ -0,0 +1,31 @@
+// description: https://leetcode-cn.com/explore/interview/card/top-interview-questions-easy/1/array/26/
+// 两个数组的交集 II
+
+/**
+ * @param {number[]} nums1
+ * @param {number[]} nums2
+ * @return {number[]}
+ */
+var intersect = function(nums1, nums2) {
+  nums1 = nums1.sort((a, b) => a - b);
+  nums2 = nums2.sort((a, b) => a - b);
+
+  const ret = [];
+
+  const len1 = nums1.length;
+  const len2 = nums2.length;
+
+  let k = 0;
+
+  for (let i = 0; i < len1; i++) {
+    for (let j = k; j < len2; j++) {
+      if (nums1[i] === nums2[j]) {
+        k = j + 1;
+        ret.push(nums1[i]);
+        break;
+      }
+    }
+  }
+
+  return ret;
+};