| | | 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.MaximumWidthRamp; |
| | | 13 | | |
| | | 14 | | /// <inheritdoc /> |
| | | 15 | | public class MaximumWidthRampStack : IMaximumWidthRamp |
| | | 16 | | { |
| | | 17 | | /// <summary> |
| | | 18 | | /// Time complexity - O(n) |
| | | 19 | | /// Space complexity - O(n) |
| | | 20 | | /// </summary> |
| | | 21 | | /// <param name="nums"></param> |
| | | 22 | | /// <returns></returns> |
| | | 23 | | public int MaxWidthRamp(int[] nums) |
| | 3 | 24 | | { |
| | 3 | 25 | | var stack = new Stack<int>(); |
| | | 26 | | |
| | 98 | 27 | | for (var i = 0; i < nums.Length; i++) |
| | 46 | 28 | | { |
| | 46 | 29 | | if (stack.Count == 0 || nums[i] < nums[stack.Peek()]) |
| | 16 | 30 | | { |
| | 16 | 31 | | stack.Push(i); |
| | 16 | 32 | | } |
| | 46 | 33 | | } |
| | | 34 | | |
| | 3 | 35 | | var ramp = 0; |
| | | 36 | | |
| | 36 | 37 | | for (var i = nums.Length - 1; i >= 0; i--) |
| | 18 | 38 | | { |
| | 18 | 39 | | if (i <= ramp) |
| | 3 | 40 | | { |
| | 3 | 41 | | break; |
| | | 42 | | } |
| | | 43 | | |
| | 23 | 44 | | while (stack.Count > 0 && nums[i] >= nums[stack.Peek()]) |
| | 8 | 45 | | { |
| | 8 | 46 | | ramp = Math.Max(ramp, i - stack.Pop()); |
| | 8 | 47 | | } |
| | | 48 | | |
| | 15 | 49 | | if (stack.Count == 0) |
| | 0 | 50 | | { |
| | 0 | 51 | | break; |
| | | 52 | | } |
| | 15 | 53 | | } |
| | | 54 | | |
| | 3 | 55 | | return ramp; |
| | 3 | 56 | | } |
| | | 57 | | } |