Intersection of Two Arrays II

Author: w2xi

README.md

@@ -9,4 +9,5 @@
 |14|[最长公共前缀](https://leetcode-cn.com/problems/longest-common-prefix/)|[JavaScript](./algorithms/longest-common-prefix.js)|Easy|
 |21|[合并两个有序链表](https://leetcode-cn.com/problems/merge-two-sorted-lists/)|[JavaScript](./algorithms/merge-two-sorted-lists.js)|Easy|
 |189|[轮转数组](https://leetcode-cn.com/problems/rotate-array/)|[JavaScript](./algorithms/rotate-array.js)|Medium|
-|349|[两个数组的交集](https://leetcode-cn.com/problems/intersection-of-two-arrays/)|[JavaScript](./algorithms/intersection-of-two-arrays.js)|Easy|
+|349|[两个数组的交集](https://leetcode-cn.com/problems/intersection-of-two-arrays/)|[JavaScript](./algorithms/intersection-of-two-arrays.js)|Easy|
+|350|[两个数组的交集 II](https://leetcode-cn.com/problems/intersection-of-two-arrays-ii/)|[JavaScript](./algorithms/intersection-of-two-arrays-ii.js)|Easy|

algorithms/intersection-of-two-arrays-ii.js

@@ -0,0 +1,31 @@
+/** 
+ * 映射
+ * @param {number[]} nums1
+ * @param {number[]} nums2
+ * @return {number[]}
+ */
+ var intersect = function(nums1, nums2) {
+  // 保存 nums2 中每个数字出现的次数
+  const o = {}
+  const result = []
+
+  for (let i = 0; i < nums2.length; i++) {
+      const curr = nums2[i]
+      o[curr] || (o[curr] = 0)
+      o[curr]++
+  }
+
+  for (let i = 0; i < nums1.length; i++) {
+      const curr = nums1[i]
+
+      if (o[curr]) {
+          result.push(curr)
+          o[curr]--
+      }
+  }
+
+  return result
+};
+
+// 双指针
+// ...