#1603
Easy Algorithms Design parking system
Design Simulation Counting
87.2% acceptance
Feb 23, 2026
2055
458
Design a parking system for a parking lot. The parking lot has three kinds of parking spaces: big, medium, and small, with a fixed number of slots for each size.
Implement the ParkingSystem class:
ParkingSystem(int big, int medium, int small) Initializes object of the ParkingSystem class. The number of slots for each parking space are given as part of the constructor.
bool addCar(int carType) Checks whether there is a parking space of carType for the car that wants to get into the parking lot. carType can be of three kinds: big, medium, or small, which are represented by 1, 2, and 3 respectively. A car can only park in a parking space of its carType. If there is no space available, return false, else park the car in that size space and return true.
Solution
Rust
Time O(1)
Space O(1)
pub struct ParkingSystem {
slots: [i32; 3],
}
impl ParkingSystem {
pub fn new(big: i32, medium: i32, small: i32) -> Self {
ParkingSystem { slots: [big, medium, small] }
}
pub fn add_car(&mut self, car_type: i32) -> bool {
let idx = (car_type - 1) as usize;
if self.slots[idx] > 0 {
self.slots[idx] -= 1;
true
} else {
false
}
}
}