-
Notifications
You must be signed in to change notification settings - Fork 259
/
Copy pathparking-lot.cpp
341 lines (284 loc) · 8.25 KB
/
parking-lot.cpp
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
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
// Time: O(n * m * k)
// Space: O(n * m * k)
#include <memory>
// enum type for Vehicle
enum class VehicleSize {
Motorcycle,
Compact,
Large
};
// Foward declaration to make circular reference work.
class ParkingSpot;
class Level;
// Use pImpl idiom to make copy assignment work.
class VehicleImpl {
public:
vector<weak_ptr<ParkingSpot>> parking_spots() const noexcept {
return parking_spots_;
}
int spots_needed() const noexcept {
return spots_needed_;
}
VehicleSize size() const noexcept {
return size_;
}
void park_in_spot(const shared_ptr<ParkingSpot>& spot) {
parking_spots_.emplace_back(spot);
}
void clear_spots();
virtual bool can_fit_in_spot(const shared_ptr<ParkingSpot>& spot)
const noexcept {
return true;
}
protected:
vector<weak_ptr<ParkingSpot>> parking_spots_;
int spots_needed_;
VehicleSize size_;
};
class Vehicle {
public:
Vehicle() : pImpl_(make_shared<VehicleImpl>()) {}
vector<weak_ptr<ParkingSpot>> parking_spots() const noexcept {
return pImpl_->parking_spots();
}
int spots_needed() const noexcept {
return pImpl_->spots_needed();
}
VehicleSize size() const noexcept {
return pImpl_->size();
}
void park_in_spot(const shared_ptr<ParkingSpot>& spot) {
pImpl_->park_in_spot(spot);
}
void clear_spots() {
pImpl_->clear_spots();
}
virtual bool can_fit_in_spot(const shared_ptr<ParkingSpot>& spot)
const noexcept {
return pImpl_->can_fit_in_spot(spot);
}
protected:
shared_ptr<VehicleImpl> pImpl_;
};
class ParkingSpot : public std::enable_shared_from_this<ParkingSpot> {
public:
ParkingSpot(const shared_ptr<Level>& level, int row,
int spot_number, VehicleSize spot_size) :
level_(level), row_(row),
spot_number_(spot_number), spot_size_(spot_size),
vehicle_(nullptr) {}
bool is_available() const noexcept {
return vehicle_ == nullptr;
}
bool can_fit_vehicle(Vehicle *vehicle) {
return is_available() && vehicle->can_fit_in_spot(shared_from_this());
}
void park(Vehicle *vehicle) {
vehicle_ = vehicle;
vehicle_->park_in_spot(shared_from_this());
}
void remove_vehicle();
int row() const noexcept {
return row_;
}
int spot_number() const noexcept {
return spot_number_;
}
VehicleSize size() const noexcept {
return spot_size_;
}
private:
weak_ptr<Level> level_;
int row_, spot_number_;
VehicleSize spot_size_;
Vehicle *vehicle_;
};
// Use pImpl idiom to make copy assignment work.
class BusImpl: public VehicleImpl {
public:
BusImpl() {
spots_needed_ = 5;
size_ = VehicleSize::Large;
}
virtual bool can_fit_in_spot(const shared_ptr<ParkingSpot>& spot)
const noexcept {
return spot->size() == VehicleSize::Large;
}
};
class Bus: public Vehicle {
public:
Bus() {
pImpl_ = make_shared<BusImpl>();
}
};
// Use pImpl idiom to make copy assignment work.
class CarImpl: public VehicleImpl {
public:
CarImpl() {
spots_needed_ = 1;
size_ = VehicleSize::Compact;
}
virtual bool can_fit_in_spot(const shared_ptr<ParkingSpot>& spot)
const noexcept {
return spot->size() != VehicleSize::Motorcycle;
}
};
class Car: public Vehicle {
public:
Car() {
pImpl_ = make_shared<CarImpl>();
}
};
// Use pImpl idiom to make copy assignment work.
class MotorcycleImpl: public VehicleImpl {
public:
MotorcycleImpl() {
spots_needed_ = 1;
size_ = VehicleSize::Motorcycle;
}
virtual bool can_fit_in_spot(const shared_ptr<ParkingSpot>& spot)
const noexcept {
return true;
}
};
class Motorcycle: public Vehicle {
public:
Motorcycle() {
pImpl_ = make_shared<MotorcycleImpl>();
}
};
class Level : public std::enable_shared_from_this<Level> {
public:
Level(int flr, int num_rows, int spots_per_row) :
num_rows_(num_rows),
floor_(flr),
spots_per_row_(spots_per_row),
number_spots_(0),
available_spots_(0) {
}
// Use two-phase construction to avoid the problem that
// shared_from_this() cannot be used in ctor!
void init() {
for (int row = 0; row < num_rows_; ++row) {
int i = 0;
for (; i < spots_per_row_ / 4; ++i) {
spots_.emplace_back(
make_shared<ParkingSpot>(shared_from_this(),
row, number_spots_,
VehicleSize::Motorcycle));
++number_spots_;
}
for (; i < spots_per_row_ / 4 * 3; ++i) {
spots_.emplace_back(
make_shared<ParkingSpot>(shared_from_this(),
row, number_spots_,
VehicleSize::Compact));
++number_spots_;
}
for (; i < spots_per_row_; ++i) {
spots_.emplace_back(
make_shared<ParkingSpot>(shared_from_this(),
row, number_spots_,
VehicleSize::Large));
++number_spots_;
}
}
available_spots_ = number_spots_;
}
bool park_vehicle(Vehicle *vehicle) {
if (available_spots() < vehicle->spots_needed()) {
return false;
}
const auto& spot_num = find_available_spots(vehicle);
if (spot_num < 0) {
return false;
} else {
park_starting_at_spot(spot_num, vehicle);
return true;
}
}
int find_available_spots(Vehicle *vehicle) {
const auto& spots_needed = vehicle->spots_needed();
int last_row = -1;
int spots_found = 0;
for (int i = 0; i < spots_.size(); ++i) {
auto& spot = spots_[i];
if (last_row != spot->row()) {
spots_found = 0;
last_row = spot->row();
}
if (spot->can_fit_vehicle(vehicle)) {
++spots_found;
} else {
spots_found = 0;
}
if (spots_found == spots_needed) {
return i - (spots_needed - 1);
}
}
return -1;
}
void park_starting_at_spot(int spot_num, Vehicle *vehicle) {
for (int i = spot_num; i < spot_num + vehicle->spots_needed(); ++i) {
spots_[i]->park(vehicle);
}
available_spots_ -= vehicle->spots_needed();
}
void spot_freed() noexcept {
++available_spots_;
}
int available_spots() const noexcept {
return available_spots_;
}
private:
int num_rows_;
int floor_;
int spots_per_row_;
int number_spots_;
int available_spots_;
vector<shared_ptr<ParkingSpot>> spots_;
};
void VehicleImpl::clear_spots() {
for (const auto& spot : parking_spots_) {
if (auto spt = spot.lock()) {
spt->remove_vehicle();
}
}
parking_spots_.clear();
}
void ParkingSpot::remove_vehicle() {
if (auto spt = level_.lock()) {
spt->spot_freed();
}
vehicle_ = nullptr;
}
class ParkingLot {
public:
// @param n number of leves
// @param num_rows each level has num_rows rows of spots
// @param spots_per_row each row has spots_per_row spots
ParkingLot(int n, int num_rows, int spots_per_row) {
for (int i = 0; i < n; ++i) {
auto&& ptr = make_shared<Level>(i, num_rows, spots_per_row);
ptr->init();
levels_.emplace_back(ptr);
}
}
// Park the vehicle in a spot (or multiple spots)
// Return false if failed
bool parkVehicle(Vehicle &vehicle) {
unParkVehicle(vehicle); // This may make the parked vehicle move to another place.
for (auto& level : levels_) {
if (level->park_vehicle(&vehicle)) {
return true;
}
}
return false;
}
// unPark the vehicle
void unParkVehicle(Vehicle &vehicle) {
vehicle.clear_spots();
}
private:
vector<shared_ptr<Level>> levels_;
};