微信公众号搜"智元新知"关注
微信扫一扫可直接关注哦!

OOD 2 : design parking lot

public enum VehicleSize{
  Compact(1);
  Large(2); // ? why use number 
  
  private final int size;
  
  VehicleSize(int size){
    this.size = size;
  }
  
  public int getSize(){
    return size;
  }
}



public abstract class Vehicle{
  public abstract VehicleSize getSize();
}


public class Car extends Vehicle{
  @Override 
  public VehicleSize getSize(){
    return VehicleSize.Compact;
  }
}

public class Truck extends Vehicle{
  @Override 
  public VehicleSize getSize(){
    return VehicleSize.Large;
  }
}

class ParkingSpot{
  private final VehicleSize size;
  private Vehicle currentVehicle;
  
  
  ParkingSpot(VehicleSize size){
    this.size = size;
  }
  
  boolean fit(Vehicle v){
    return currentVehicle == null && size.getSize() >= v.getSize().getSize();
    // first get the type,compact or large,and the compare the number of the types 
  }
  
  void park(Vehicle v){
    currentVehicle = v;
  }
  
  void leave(){
    currentVehicle = null;
  }
  
  Vehicle getVehicle(){
    return currentVehicle;
  }
}


class Level{
  private final List<ParkingSpot> spots;
  
  Level(int numOfSpots){
    List<ParkingSot> list = new ArrayList<>(numOfSpots);
    for(int i = 0; i < numOfSpots / 2; i++){
      list.add(new ParkingSpot(VehicleSize.Compact));
    }
    
    for(int i = numOfSpots / 2; i < numOfSpots; i++){
      liat.add(new ParkingSpot(VehicleSize.Large));
    }
    
    spots = Collections.unmodifiableList(list);// ??
  }
  
  boolean hasspot(Vehicle v){
    for(ParkingSpot s : spots){
      if(s.fit(v)){
        return true;
      }
    }
    return false;
  }
  
  boolean park(Vehicle v){
    for(ParkingSpot s : spots){
      if(s.fit(v)){
        s.park(v);
        return true;
      }
    }
    return false;
  }
  
  boolean leave(Vehicle v){
    for(ParkingSpot s : spots){
      if(s.getVehicle() == v){ // ? 
        s.leave(); // ? 
        return true;
      }
    }
    return false;
  }
}

public class ParkingLot{
  private final Level[] levels;
  
  public ParkingLot(int numLevels,int numSpotsPerLevel){
    levels = new Level[numLevels];
    for(int i = 0; i < numLevels; i++){
      levels[i] = new Level(numSpotsPerLevel);
    }
  }
  
  public boolean hasspot(Vehicle v){
    for(Level l : levels){
      if(l.hasspot(v)){
        return true;
      }
    }
    return false;
  }
  
  public boolean park(Vehicle v){
    for(Level l : levels){
      if(l.park(v)){
        return true;
      }
    }
    return false;
  }
  
  public boolean leave(Vehicle v){
    for(Level l : levels){
      if(l.leave(v)){
        return true;
      }
    }
    return false;
  }
}


// don‘t understand this test 
class Test{
  public static void main(String[] args){
    // ParkingLot lot = new ParkingLot(4,10);
    List<Vehicle> list = new ArrayList<>();
    for(int i = 0; i < 50; i++){
      final Vehicle v = i % 2 == 0 ? new Car(); new Truck();
      list.add(v);
      boolean hasspot == lot.hasspot(v);
      if(i < 40){
        // make sure you enable assert if using it for test
        assert hasspot;
        assert lot.park(v);
      }else{
        assert !hasspot();
        assert !lot.park(v);
      }
    }
    assert list.size() == 50;
    int i = 0;
    for(Vehicle v : list){
      assert i >= 40 || lot.leave(v);
      i++;
    }
  }
}

版权声明:本文内容由互联网用户自发贡献,该文观点与技术仅代表作者本人。本站仅提供信息存储空间服务,不拥有所有权,不承担相关法律责任。如发现本站有涉嫌侵权/违法违规的内容, 请发送邮件至 dio@foxmail.com 举报,一经查实,本站将立刻删除。

相关推荐