-
Notifications
You must be signed in to change notification settings - Fork 0
/
FindTheDifferenceOfTwoArrays.ts
47 lines (44 loc) · 1.75 KB
/
FindTheDifferenceOfTwoArrays.ts
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
// Source : https://leetcode.com/problems/find-the-difference-of-two-arrays/
// Author : squxq
// Date : 2023-09-11
/*****************************************************************************************************
*
* Given two 0-indexed integer arrays nums1 and nums2, return a list answer of size 2 where:
*
* answer[0] is a list of all distinct integers in nums1 which are not present in nums2.
* answer[1] is a list of all distinct integers in nums2 which are not present in nums1.
*
* Note that the integers in the lists may be returned in any order.
*
* Example 1:
*
* Input: nums1 = [1,2,3], nums2 = [2,4,6]
* Output: [[1,3],[4,6]]
* Explanation:
* For nums1, nums1[1] = 2 is present at index 0 of nums2, whereas nums1[0] = 1 and nums1[2] = 3 are
* not present in nums2. Therefore, answer[0] = [1,3].
* For nums2, nums2[0] = 2 is present at index 1 of nums1, whereas nums2[1] = 4 and nums2[2] = 6 are
* not present in nums2. Therefore, answer[1] = [4,6].
*
* Example 2:
*
* Input: nums1 = [1,2,3,3], nums2 = [1,1,2,2]
* Output: [[3],[]]
* Explanation:
* For nums1, nums1[2] and nums1[3] are not present in nums2. Since nums1[2] == nums1[3], their value
* is only included once and answer[0] = [3].
* Every integer in nums2 is present in nums1. Therefore, answer[1] = [].
*
* Constraints:
*
* 1 <= nums1.length, nums2.length <= 1000
* -1000 <= nums1[i], nums2[i] <= 1000
******************************************************************************************************/
export function findDifference(nums1: number[], nums2: number[]): number[][] {
const set1 = new Set<number>(nums1);
const set2 = new Set<number>(nums2);
return [
[...set1].filter((num) => !set2.has(num)),
[...set2].filter((num) => !set1.has(num)),
];
}