Skip to main content

< Back to Data Structures and Algorithms

LeetCode 1603 · Design

Design Parking System

A car park with so many big, medium and small spaces, letting a car in only while a space of its size is free.

Step through it

Examples
Edge cases
Calls
  1. new ParkingSystem(1, 1, 0)
  2. addCar(1)
  3. addCar(2)
  4. addCar(3)
  5. addCar(1)
this

Not made yet

Step 0 of 5

Output

Running… play or step to the end.

The code

/**
 * A class for a parking system containing big, medium and small parking spaces 
 * @param {number} big
 * @param {number} medium
 * @param {number} small
 */
const ParkingSystem = function(big, medium, small) {
    // Contains the number of spaces available for each size.
    this.data = { 1: big, 2: medium, 3: small }
}

/** 
 * Attempts to park a car in a parking space.
 * @param {number} carType // The size of vehicle
 * @return {boolean} // Whether or not the car was parked.
 */
ParkingSystem.prototype.addCar = function(carType) {
    // There is a parking space available that matches the car size.
    if (this.data[carType]) {
        // Decrement the amount of spaces available for that car size.
        this.data[carType] -= 1
        // Car is parked.
        return true
    }
    
    // No spaces available matching the car size, car cannot park.
    return false
}

/** 
 * Your ParkingSystem object will be instantiated and called as such:
 * var obj = new ParkingSystem(big, medium, small)
 * var param_1 = obj.addCar(carType)
 */

View it on GitHub (opens in a new tab)