| | | 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.NextGreaterElement1; |
| | | 13 | | |
| | | 14 | | /// <inheritdoc /> |
| | | 15 | | public class NextGreaterElement1BruteForce : INextGreaterElement1 |
| | | 16 | | { |
| | | 17 | | /// <summary> |
| | | 18 | | /// Time complexity - O(n * m) |
| | | 19 | | /// Space complexity - O(n) |
| | | 20 | | /// </summary> |
| | | 21 | | /// <param name="nums1"></param> |
| | | 22 | | /// <param name="nums2"></param> |
| | | 23 | | /// <returns></returns> |
| | | 24 | | public int[] NextGreaterElement(int[] nums1, int[] nums2) |
| | 2 | 25 | | { |
| | 2 | 26 | | var result = new int[nums1.Length]; |
| | | 27 | | |
| | 14 | 28 | | for (var i = 0; i < nums1.Length; i++) |
| | 5 | 29 | | { |
| | 5 | 30 | | var nextIndex = -1; |
| | | 31 | | |
| | 28 | 32 | | for (var j = 0; j < nums2.Length; j++) |
| | 14 | 33 | | { |
| | 14 | 34 | | if (nums1[i] != nums2[j]) |
| | 9 | 35 | | { |
| | 9 | 36 | | continue; |
| | | 37 | | } |
| | | 38 | | |
| | 5 | 39 | | nextIndex = j; |
| | | 40 | | |
| | 5 | 41 | | break; |
| | | 42 | | } |
| | | 43 | | |
| | 5 | 44 | | var next = -1; |
| | | 45 | | |
| | 5 | 46 | | if (nextIndex >= 0) |
| | 5 | 47 | | { |
| | 22 | 48 | | for (var j = nextIndex; j < nums2.Length; j++) |
| | 8 | 49 | | { |
| | 8 | 50 | | if (nums2[j] <= nums1[i]) |
| | 6 | 51 | | { |
| | 6 | 52 | | continue; |
| | | 53 | | } |
| | | 54 | | |
| | 2 | 55 | | next = nums2[j]; |
| | | 56 | | |
| | 2 | 57 | | break; |
| | | 58 | | } |
| | 5 | 59 | | } |
| | | 60 | | |
| | 5 | 61 | | result[i] = next; |
| | 5 | 62 | | } |
| | | 63 | | |
| | 2 | 64 | | return result; |
| | 2 | 65 | | } |
| | | 66 | | } |