-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathParkingLot.java
183 lines (144 loc) · 2.94 KB
/
ParkingLot.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
public enum VehicleSize {
Compact(1);
Large(2);
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();
}
/**record a vehicle is parked in by updating the currentVehicle field*/
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<ParkingSpot> list = new ArrayList<>(numOfSpots);
int i = 0;
for (; i < numOfSpots / 2; i++) {
list.add(new ParkingSpot(VehicleSize.Compact));
}
for (; i < numOfSpots; i++) {
list.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 fianl 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;
}
}
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++;
}
}
}