| | 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.RestoreFinishingOrder; |
| | 13 | |
|
| | 14 | | /// <inheritdoc /> |
| | 15 | | public class RestoreFinishingOrderHashSet : IRestoreFinishingOrder |
| | 16 | | { |
| | 17 | | /// <summary> |
| | 18 | | /// Time complexity - O(n) |
| | 19 | | /// Space complexity - O(n) |
| | 20 | | /// </summary> |
| | 21 | | /// <param name="orders"></param> |
| | 22 | | /// <param name="friends"></param> |
| | 23 | | /// <returns></returns> |
| | 24 | | public int[] RecoverOrder(int[] orders, int[] friends) |
| 2 | 25 | | { |
| 2 | 26 | | var friendsHashSet = new HashSet<int>(friends); |
| | 27 | |
|
| 2 | 28 | | var friendsIndex = 0; |
| | 29 | |
|
| 24 | 30 | | foreach (var order in orders) |
| 10 | 31 | | { |
| 10 | 32 | | if (!friendsHashSet.Contains(order)) |
| 5 | 33 | | { |
| 5 | 34 | | continue; |
| | 35 | | } |
| | 36 | |
|
| 5 | 37 | | friends[friendsIndex++] = order; |
| | 38 | |
|
| 5 | 39 | | if (friendsIndex == friends.Length) |
| 2 | 40 | | { |
| 2 | 41 | | break; |
| | 42 | | } |
| 3 | 43 | | } |
| | 44 | |
|
| 2 | 45 | | return friends; |
| 2 | 46 | | } |
| | 47 | | } |