| | | 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.TrappingRainWater; |
| | | 13 | | |
| | | 14 | | /// <inheritdoc /> |
| | | 15 | | public class TrappingRainWaterIterative : ITrappingRainWater |
| | | 16 | | { |
| | | 17 | | /// <summary> |
| | | 18 | | /// Time complexity - O(n) |
| | | 19 | | /// Space complexity - O(1) |
| | | 20 | | /// </summary> |
| | | 21 | | /// <param name="height"></param> |
| | | 22 | | /// <returns></returns> |
| | | 23 | | public int Trap(int[] height) |
| | 2 | 24 | | { |
| | 2 | 25 | | var result = 0; |
| | | 26 | | |
| | 2 | 27 | | var left = 0; |
| | 2 | 28 | | var right = height.Length - 1; |
| | | 29 | | |
| | 2 | 30 | | var leftMax = 0; |
| | 2 | 31 | | var rightMax = 0; |
| | | 32 | | |
| | 18 | 33 | | while (left < right) |
| | 16 | 34 | | { |
| | 16 | 35 | | if (height[left] <= height[right]) |
| | 12 | 36 | | { |
| | 12 | 37 | | if (height[left] >= leftMax) |
| | 4 | 38 | | { |
| | 4 | 39 | | leftMax = height[left]; |
| | 4 | 40 | | } |
| | | 41 | | else |
| | 8 | 42 | | { |
| | 8 | 43 | | result += leftMax - height[left]; |
| | 8 | 44 | | } |
| | | 45 | | |
| | 12 | 46 | | left++; |
| | 12 | 47 | | } |
| | | 48 | | else |
| | 4 | 49 | | { |
| | 4 | 50 | | if (height[right] >= rightMax) |
| | 3 | 51 | | { |
| | 3 | 52 | | rightMax = height[right]; |
| | 3 | 53 | | } |
| | | 54 | | else |
| | 1 | 55 | | { |
| | 1 | 56 | | result += rightMax - height[right]; |
| | 1 | 57 | | } |
| | | 58 | | |
| | 4 | 59 | | right--; |
| | 4 | 60 | | } |
| | 16 | 61 | | } |
| | | 62 | | |
| | 2 | 63 | | return result; |
| | 2 | 64 | | } |
| | | 65 | | } |