350. Intersection of Two Arrays II (#71)

Author: Kohei Asai

solutions/intersectionOfTwoArrays2.test.ts

@@ -0,0 +1,148 @@
+import intersect from "./intersectionOfTwoArrays2";
+
+describe("350. Intersection of Two Arrays II", () => {
+  test("#1", () => {
+    expect(intersect([1, 2, 2, 1], [2, 2]).sort()).toEqual([2, 2].sort());
+  });
+
+  test("#2", () => {
+    expect(intersect([4, 9, 5], [9, 4, 9, 8, 4]).sort()).toEqual([4, 9].sort());
+  });
+
+  test("#3", () => {
+    expect(
+      intersect(
+        [
+          61,
+          24,
+          20,
+          58,
+          95,
+          53,
+          17,
+          32,
+          45,
+          85,
+          70,
+          20,
+          83,
+          62,
+          35,
+          89,
+          5,
+          95,
+          12,
+          86,
+          58,
+          77,
+          30,
+          64,
+          46,
+          13,
+          5,
+          92,
+          67,
+          40,
+          20,
+          38,
+          31,
+          18,
+          89,
+          85,
+          7,
+          30,
+          67,
+          34,
+          62,
+          35,
+          47,
+          98,
+          3,
+          41,
+          53,
+          26,
+          66,
+          40,
+          54,
+          44,
+          57,
+          46,
+          70,
+          60,
+          4,
+          63,
+          82,
+          42,
+          65,
+          59,
+          17,
+          98,
+          29,
+          72,
+          1,
+          96,
+          82,
+          66,
+          98,
+          6,
+          92,
+          31,
+          43,
+          81,
+          88,
+          60,
+          10,
+          55,
+          66,
+          82,
+          0,
+          79,
+          11,
+          81
+        ],
+        [
+          5,
+          25,
+          4,
+          39,
+          57,
+          49,
+          93,
+          79,
+          7,
+          8,
+          49,
+          89,
+          2,
+          7,
+          73,
+          88,
+          45,
+          15,
+          34,
+          92,
+          84,
+          38,
+          85,
+          34,
+          16,
+          6,
+          99,
+          0,
+          2,
+          36,
+          68,
+          52,
+          73,
+          50,
+          77,
+          44,
+          61,
+          48
+        ]
+      ).sort()
+    ).toEqual(
+      [5, 4, 57, 79, 7, 89, 88, 45, 34, 92, 38, 85, 6, 0, 77, 44, 61].sort()
+    );
+  });
+});

solutions/intersectionOfTwoArrays2.ts

@@ -0,0 +1,25 @@
+// 350. Intersection of Two Arrays II
+// https://leetcode.com/problems/intersection-of-two-arrays-ii/
+export default function intersect(nums1: number[], nums2: number[]): number[] {
+  const intersection: number[] = [];
+  const sorted1 = [...nums1].sort((a, b) => a - b);
+  const sorted2 = [...nums2].sort((a, b) => a - b);
+
+  let i1 = 0;
+  let i2 = 0;
+
+  while (i1 < sorted1.length && i2 < sorted2.length) {
+    if (sorted1[i1] === sorted2[i2]) {
+      intersection.push(sorted1[i1]);
+
+      i1 += 1;
+      i2 += 1;
+    } else if (sorted1[i1] < sorted2[i2]) {
+      i1 += 1;
+    } else if (sorted1[i1] > sorted2[i2]) {
+      i2 += 1;
+    }
+  }
+
+  return intersection;
+}