| | | 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.HeightChecker; |
| | | 13 | | |
| | | 14 | | /// <inheritdoc /> |
| | | 15 | | public class HeightCheckerCountingSort : IHeightChecker |
| | | 16 | | { |
| | | 17 | | /// <summary> |
| | | 18 | | /// Time complexity - O(n + k), where n is the number of elements in the input array and k is the range of the i |
| | | 19 | | /// values |
| | | 20 | | /// Space complexity - O(n) |
| | | 21 | | /// </summary> |
| | | 22 | | /// <param name="heights"></param> |
| | | 23 | | /// <returns></returns> |
| | | 24 | | public int HeightChecker(int[] heights) |
| | 3 | 25 | | { |
| | 3 | 26 | | var maxHeight = heights.Max(); |
| | | 27 | | |
| | 3 | 28 | | var count = new int[maxHeight + 1]; |
| | | 29 | | |
| | 41 | 30 | | foreach (var height in heights) |
| | 16 | 31 | | { |
| | 16 | 32 | | count[height]++; |
| | 16 | 33 | | } |
| | | 34 | | |
| | 3 | 35 | | var result = 0; |
| | 3 | 36 | | var currentHeight = 0; |
| | | 37 | | |
| | 41 | 38 | | foreach (var height in heights) |
| | 16 | 39 | | { |
| | 30 | 40 | | while (count[currentHeight] == 0) |
| | 14 | 41 | | { |
| | 14 | 42 | | currentHeight++; |
| | 14 | 43 | | } |
| | | 44 | | |
| | 16 | 45 | | if (currentHeight != height) |
| | 8 | 46 | | { |
| | 8 | 47 | | result++; |
| | 8 | 48 | | } |
| | | 49 | | |
| | 16 | 50 | | count[currentHeight]--; |
| | 16 | 51 | | } |
| | | 52 | | |
| | 3 | 53 | | return result; |
| | 3 | 54 | | } |
| | | 55 | | } |