| | | 1 | | // -------------------------------------------------------------------------------- |
| | | 2 | | // Copyright (C) 2025 Eugene Eremeev (also known as Yevhenii Yeriemeieiv). |
| | | 3 | | // All Rights Reserved. |
| | | 4 | | // -------------------------------------------------------------------------------- |
| | | 5 | | // This software is the confidential and proprietary information of Eugene Eremeev |
| | | 6 | | // (also known as Yevhenii Yeriemeieiv) ("Confidential Information"). You shall not |
| | | 7 | | // disclose such Confidential Information and shall use it only in accordance with |
| | | 8 | | // the terms of the license agreement you entered into with Eugene Eremeev (also |
| | | 9 | | // known as Yevhenii Yeriemeieiv). |
| | | 10 | | // -------------------------------------------------------------------------------- |
| | | 11 | | |
| | | 12 | | namespace LeetCode.Algorithms.IntersectionOfTwoArrays; |
| | | 13 | | |
| | | 14 | | /// <inheritdoc /> |
| | | 15 | | public class IntersectionOfTwoArraysHashSet : IIntersectionOfTwoArrays |
| | | 16 | | { |
| | | 17 | | /// <summary> |
| | | 18 | | /// Time complexity - O(n1 + n2) |
| | | 19 | | /// Space complexity - O(n1 + m), where m is the number of common elements between nums1 and nums2 |
| | | 20 | | /// </summary> |
| | | 21 | | /// <param name="nums1"></param> |
| | | 22 | | /// <param name="nums2"></param> |
| | | 23 | | /// <returns></returns> |
| | | 24 | | public int[] Intersection(int[] nums1, int[] nums2) |
| | 2 | 25 | | { |
| | 2 | 26 | | var nums1HashSet = new HashSet<int>(nums1); |
| | 2 | 27 | | var intersectionHashSet = new HashSet<int>(); |
| | | 28 | | |
| | 20 | 29 | | foreach (var num in nums2) |
| | 7 | 30 | | { |
| | 7 | 31 | | if (nums1HashSet.Contains(num)) |
| | 6 | 32 | | { |
| | 6 | 33 | | intersectionHashSet.Add(num); |
| | 6 | 34 | | } |
| | 7 | 35 | | } |
| | | 36 | | |
| | 2 | 37 | | return [.. intersectionHashSet]; |
| | 2 | 38 | | } |
| | | 39 | | } |