| | | 1 | | // -------------------------------------------------------------------------------- |
| | | 2 | | // Copyright (C) 2026 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 sealed class RestoreFinishingOrderLookup : 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 ordersLength = orders.Length; |
| | 2 | 27 | | var friendsLength = friends.Length; |
| | | 28 | | |
| | 2 | 29 | | Span<bool> friendsLookup = stackalloc bool[ordersLength]; |
| | | 30 | | |
| | 14 | 31 | | for (var i = 0; i < friendsLength; i++) |
| | 5 | 32 | | { |
| | 5 | 33 | | friendsLookup[friends[i] - 1] = true; |
| | 5 | 34 | | } |
| | | 35 | | |
| | 2 | 36 | | var friendsIndex = 0; |
| | | 37 | | |
| | 24 | 38 | | foreach (var order in orders) |
| | 10 | 39 | | { |
| | 10 | 40 | | if (!friendsLookup[order - 1]) |
| | 5 | 41 | | { |
| | 5 | 42 | | continue; |
| | | 43 | | } |
| | | 44 | | |
| | 5 | 45 | | friends[friendsIndex++] = order; |
| | | 46 | | |
| | 5 | 47 | | if (friendsIndex == friendsLength) |
| | 2 | 48 | | { |
| | 2 | 49 | | break; |
| | | 50 | | } |
| | 3 | 51 | | } |
| | | 52 | | |
| | 2 | 53 | | return friends; |
| | 2 | 54 | | } |
| | | 55 | | } |