| | | 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.MinimumCommonValue; |
| | | 13 | | |
| | | 14 | | /// <inheritdoc /> |
| | | 15 | | public class MinimumCommonValueHashSet : IMinimumCommonValue |
| | | 16 | | { |
| | | 17 | | /// <summary> |
| | | 18 | | /// Time complexity - O(n + m), where n is the length of nums2 and m is the length of nums1 |
| | | 19 | | /// Space complexity - O(n), where n is the length of nums2 |
| | | 20 | | /// </summary> |
| | | 21 | | /// <param name="nums1"></param> |
| | | 22 | | /// <param name="nums2"></param> |
| | | 23 | | /// <returns></returns> |
| | | 24 | | public int GetCommon(int[] nums1, int[] nums2) |
| | 12 | 25 | | { |
| | 12 | 26 | | var nums2HashSet = new HashSet<int>(nums2); |
| | | 27 | | |
| | 71 | 28 | | foreach (var num1 in nums1) |
| | 21 | 29 | | { |
| | 21 | 30 | | if (nums2HashSet.Contains(num1)) |
| | 7 | 31 | | { |
| | 7 | 32 | | return num1; |
| | | 33 | | } |
| | 14 | 34 | | } |
| | | 35 | | |
| | 5 | 36 | | return -1; |
| | 12 | 37 | | } |
| | | 38 | | } |