How to design a parking lot using object-oriented principles?
Solution:
1) The parking lot has multiple levels. Each level has multiple rows of spots.
2) The parking lot can park motorcycles, cars, and buses.
3) The parking lot has motorcycle spots, compact spots, and large spots.
4) A motorcycle can park in any spot.
5) A car can park in either a single compact spot or a single large spot.
6) A bus can park in five large spots that are consecutive and within the same row. It cannot park in small spots.
In the below implementation, we have created an abstract class Vehicle, from which Car, Bus, and Motorcycle inherit.
To handle the different parking spot sizes, we have just one class ParkingSpot which has a member variable indicating the size.
So Solution would be something like this:
public enum VehicleSize { Motorcycle, Compact,Large }
public abstract class Vehicle
{
protected ArrayList<ParkingSpot> parkingSpots = new ArrayList<ParkingSpot>();
protected String licensePlate;
protected int spotsNeeded;
protected VehicleSize size;
public int getSpotsNeeded()
{
return spotsNeeded;
}
public VehicleSize getSize()
{
return size;
}
public void parkinSpot(ParkingSpot s)
{
parkingSpots.add(s);
}
public void clearSpots() { ... }
/* Checks if the spot is big enough for the
vehicle (and is available).
This * compares the SIZE only.It does not
check if it has enough spots. */
public abstract boolean canFitinSpot(ParkingSpot spot);
}
public class Bus extends Vehicle
{
public Bus()
{
spotsNeeded = 5;
size = VehicleSize.Large;
}
public boolean canFitinSpot(ParkingSpot spot)
{... }
}
public class Car extends Vehicle
{
public Car()
{
spotsNeeded = 1;
size = VehicleSize.Compact;
}
/* Checks if the spot is a Compact or a Large. */
public boolean canFitinSpot(ParkingSpot spot)
{ ... }
}
public class Motorcycle extends Vehicle
{
public Motorcycle()
{
spotsNeeded = 1;
size = VehicleSize.Motorcycle;
}
public boolean canFitinSpot(ParkingSpot spot)
{ ... }
}
The ParkingSpot is implemented by having just a variable which represents the size of the spot. We could have implemented this by having classes for LargeSpot, CompactSpot, and MotorcycleSpot which inherit from ParkingSpot, but this is probably overkilled. The spots probably do not have different behaviors, other than their sizes.
public class ParkingSpot
{
private Vehicle vehicle;
private VehicleSize spotSize;
private int row;
private int spotNumber;
private Level level;
public ParkingSpot(Level lvl, int r, int n,
VehicleSize s)
{ ... }
public boolean isAvailable()
{
return vehicle == null;
}
/* Check if the spot is big enough and is available */
public boolean canFitVehicle(Vehicle vehicle) { ... }
/* Park vehicle in this spot. */
public boolean park(Vehicle v) {..}
public int getRow()
{
return row;
}
public int getSpotNumber()
{
return spotNumber;
}
/* Remove vehicle from spot, and notify
level that a new spot is available */
public void removeVehicle() { ... }
}
Solution:
1) The parking lot has multiple levels. Each level has multiple rows of spots.
2) The parking lot can park motorcycles, cars, and buses.
3) The parking lot has motorcycle spots, compact spots, and large spots.
4) A motorcycle can park in any spot.
5) A car can park in either a single compact spot or a single large spot.
6) A bus can park in five large spots that are consecutive and within the same row. It cannot park in small spots.
In the below implementation, we have created an abstract class Vehicle, from which Car, Bus, and Motorcycle inherit.
To handle the different parking spot sizes, we have just one class ParkingSpot which has a member variable indicating the size.
So Solution would be something like this:
public enum VehicleSize { Motorcycle, Compact,Large }
public abstract class Vehicle
{
protected ArrayList<ParkingSpot> parkingSpots = new ArrayList<ParkingSpot>();
protected String licensePlate;
protected int spotsNeeded;
protected VehicleSize size;
public int getSpotsNeeded()
{
return spotsNeeded;
}
public VehicleSize getSize()
{
return size;
}
public void parkinSpot(ParkingSpot s)
{
parkingSpots.add(s);
}
public void clearSpots() { ... }
/* Checks if the spot is big enough for the
vehicle (and is available).
This * compares the SIZE only.It does not
check if it has enough spots. */
public abstract boolean canFitinSpot(ParkingSpot spot);
}
public class Bus extends Vehicle
{
public Bus()
{
spotsNeeded = 5;
size = VehicleSize.Large;
}
public boolean canFitinSpot(ParkingSpot spot)
{... }
}
public class Car extends Vehicle
{
public Car()
{
spotsNeeded = 1;
size = VehicleSize.Compact;
}
/* Checks if the spot is a Compact or a Large. */
public boolean canFitinSpot(ParkingSpot spot)
{ ... }
}
public class Motorcycle extends Vehicle
{
public Motorcycle()
{
spotsNeeded = 1;
size = VehicleSize.Motorcycle;
}
public boolean canFitinSpot(ParkingSpot spot)
{ ... }
}
The ParkingSpot is implemented by having just a variable which represents the size of the spot. We could have implemented this by having classes for LargeSpot, CompactSpot, and MotorcycleSpot which inherit from ParkingSpot, but this is probably overkilled. The spots probably do not have different behaviors, other than their sizes.
public class ParkingSpot
{
private Vehicle vehicle;
private VehicleSize spotSize;
private int row;
private int spotNumber;
private Level level;
public ParkingSpot(Level lvl, int r, int n,
VehicleSize s)
{ ... }
public boolean isAvailable()
{
return vehicle == null;
}
/* Check if the spot is big enough and is available */
public boolean canFitVehicle(Vehicle vehicle) { ... }
/* Park vehicle in this spot. */
public boolean park(Vehicle v) {..}
public int getRow()
{
return row;
}
public int getSpotNumber()
{
return spotNumber;
}
/* Remove vehicle from spot, and notify
level that a new spot is available */
public void removeVehicle() { ... }
}
No comments:
Post a Comment