We use cookies (including Google cookies) to personalize ads and analyze traffic. By continuing to use our site, you accept our Privacy Policy.

SimplyLeet
TagsDisclaimersPrivacyTermsContactAbout Us

Design Parking System

Difficulty: Easy

Problem Description

Design a parking system for a parking lot that has three kinds of parking spaces: big, medium, and small, with a fixed number of slots for each size. Implement the ParkingSystem class with methods to initialize the parking system and to add cars based on their type.

Key Insights

  • The parking lot has three types of spaces: big (1), medium (2), and small (3).
  • Each type of space has a limited number of slots, which are set during the initialization of the ParkingSystem.
  • The addCar method checks if a parking space is available for the given car type and parks the car if possible.
  • If a parking spot for the requested car type is not available, the method returns false.

Space and Time Complexity

Time Complexity: O(1) for the addCar method, as it involves simple condition checks and updates. Space Complexity: O(1) for storing the counts of available parking spaces.

Solution

To solve this problem, we can use three integer variables to keep track of the available slots for each type of parking space (big, medium, and small). The addCar method will check the appropriate variable based on the car type and decrement the count if parking is successful. If no space is available, it will return false.

Code Solutions

class ParkingSystem:
    def __init__(self, big: int, medium: int, small: int):
        # Initialize available slots for each car type
        self.available = {1: big, 2: medium, 3: small}

    def addCar(self, carType: int) -> bool:
        # Check if there's an available slot for the given car type
        if self.available[carType] > 0:
            self.available[carType] -= 1  # Park the car
            return True
        return False
← Back to All Questions