设计一个停车场

约束和假设

  1. 我们应该支持哪种类型的车辆?
    • motorcycle, Car, Bus
  2. 每种车型占用的停车位数量是否不同?
    • Yes
    • Motorcycle spot -> Motorcycle
    • Compact spot -> Motorcycle, Car
    • Large spot -> Motorcycle, Car
    • Bus can park if we have 5 consecutive “large” spots
  3. 停车场是否有多层?
    • Yes

编码实现

from abc import AMCMeta, abstractmethod

class VehicleSize(Enum):
	MOTORCYCLE = 0
	COMPACT = 1
	LARGE = 2

class Vehicle(metaclass=ABCMeta):

	def __init__(self, vehicle_size, license_plate, spot_size):
		self.vehicle_size = vehicle_size 
		self.license_plate = license_plate
		self.spot_size = spot_size
		self.spots_taken = []

	def clear_spots(self):
		for spot in self.spots_taken:
			spot.remove_vehicle(self)
		self.spots_taken = []

	def take_spot(self, spot):
		self.spots_taken.append(spot)

	@abstractmethod
	def can_fit_in_spot(self,spot):
		pass

class Motorcycle(Vehicle):
	
	def __init__(self, license_plate):        
		super(Motorcycle, self).__init__(VehicleSize.MOTORCYCLE, license_plate, spot_size=1)

	def can_fix_in_spot(self, spot):
		return true

class Car(Vehicle):
	 def __init__(self, license_plate):
	 	super(Car, self).__init__(VehicleSize.COMPACT, license_plate, spot_size)

	def can_fit_in_spot(self, spot):
		return True if (spot.size == LARGE or spot.size == COMPACT) else False

class Bus(Vehicle):
	
	def __init__(self, license_plate):
		super(Bus, self).__init__(VehicleSize.LARGE, license_plate, spot_size=5)

	def can_fit_in_spot(self, spot):
		return True if spot.size == LARGE else False

class ParkingLot(object):
	
	def __init__(self, num_levels):
		self.num_levels = num_levels
		self.levels = []

	def park_vehicle(self, vehicle):
		for level in levels:
			if level.park_vehicle(vehicle):
				return True
		return False

class Level(object):
	
	SPOTS_PER_ROW = 10

	def __init__(self, floor, total_spots):
		self.floor = floor
		self.num_spots = total_spots
		self.available_spots = 0
		self.parking_spots = []

	def spot_freed(self):
		self.available_spots += 1

	def park_vehicle(self, vehicle):
		spot = self._find_available_spot(vehicle)
		if spot is None:
			return None
		else:
			spot.park_vehicle(vehicle)
			return spot

	def _find_available_spot(self, vehicle):
		'''Find an available spot where vehicle can fix, or return None'''

	def _park_starting_at_spot(self, spot, vehicle):
		'''Occupy starting at spot.spot_number to vehicle.spot_size'''


class ParkingSpot(object):
	
	def __init__(self, level, row, spot_numberm, spot_size, vehicle_size):
		self.level = level
		self.row = row
		self.spot_numer = spot_number
		self.spot_size = spot_size
		self.vehicle_size = vehicle_size
		self.vehicle = None

	def is_available(self):
		return True if self.vehicle is None else False

	def can_fit_vehicle(self, vehicle):
		if self.vehicle is not None:
			return False
		return vehicle.can_fit_in_spot(self)

	def park_vehicle(self, vehicle): #...
	def remove_vehicle(self): #...


  • 7
    点赞
  • 7
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值