| | | 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.DesignParkingSystem; |
| | | 13 | | |
| | | 14 | | /// <inheritdoc /> |
| | | 15 | | public sealed class DesignParkingSystemCounting : IDesignParkingSystem |
| | | 16 | | { |
| | | 17 | | private readonly int _bigCapacity; |
| | | 18 | | private readonly int _mediumCapacity; |
| | | 19 | | private readonly int _smallCapacity; |
| | | 20 | | private int _bigCount; |
| | | 21 | | private int _mediumCount; |
| | | 22 | | private int _smallCount; |
| | | 23 | | |
| | | 24 | | /// <summary> |
| | | 25 | | /// Time complexity - O(1) |
| | | 26 | | /// Space complexity - O(1) |
| | | 27 | | /// </summary> |
| | | 28 | | /// <param name="bigCapacity"></param> |
| | | 29 | | /// <param name="mediumCapacity"></param> |
| | | 30 | | /// <param name="smallCapacity"></param> |
| | 11 | 31 | | public DesignParkingSystemCounting(int bigCapacity, int mediumCapacity, int smallCapacity) |
| | 11 | 32 | | { |
| | 11 | 33 | | _bigCapacity = bigCapacity; |
| | 11 | 34 | | _mediumCapacity = mediumCapacity; |
| | 11 | 35 | | _smallCapacity = smallCapacity; |
| | 11 | 36 | | } |
| | | 37 | | |
| | | 38 | | /// <summary> |
| | | 39 | | /// Time complexity - O(1) |
| | | 40 | | /// Space complexity - O(1) |
| | | 41 | | /// </summary> |
| | | 42 | | /// <param name="carType"></param> |
| | | 43 | | /// <returns></returns> |
| | | 44 | | public bool AddCar(int carType) |
| | 37 | 45 | | { |
| | 37 | 46 | | switch (carType) |
| | | 47 | | { |
| | 13 | 48 | | case 1 when _bigCount == _bigCapacity: |
| | | 49 | | |
| | 4 | 50 | | return false; |
| | | 51 | | case 1: |
| | 9 | 52 | | _bigCount++; |
| | | 53 | | |
| | 9 | 54 | | return true; |
| | 12 | 55 | | case 2 when _mediumCount == _mediumCapacity: |
| | | 56 | | |
| | 3 | 57 | | return false; |
| | | 58 | | case 2: |
| | 9 | 59 | | _mediumCount++; |
| | | 60 | | |
| | 9 | 61 | | return true; |
| | 11 | 62 | | case 3 when _smallCount == _smallCapacity: |
| | | 63 | | |
| | 2 | 64 | | return false; |
| | | 65 | | case 3: |
| | 9 | 66 | | _smallCount++; |
| | | 67 | | |
| | 9 | 68 | | return true; |
| | | 69 | | default: |
| | 1 | 70 | | return false; |
| | | 71 | | } |
| | 37 | 72 | | } |
| | | 73 | | } |