-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathCafeOrderChecker.js
105 lines (87 loc) · 3.5 KB
/
CafeOrderChecker.js
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
function isFirstComeFirstServed(takeOutOrders, dineInOrders, servedOrders) {
var takeOutIndex = 0;
var dineInIndex = 0;
for (var i = 0; i < servedOrders.length; i++) {
if (takeOutOrders[takeOutIndex] && servedOrders[i] == takeOutOrders[takeOutIndex]) {
takeOutIndex++;
} else if (dineInOrders[dineInIndex] && servedOrders[i] == dineInOrders[dineInIndex]) {
dineInIndex++;
} else {
return false;
}
}
if (takeOutIndex != takeOutOrders.length || dineInIndex != dineInOrders.length) {
return false;
}
return true;
}
//O(n) time and O(1) space
// Tests
let desc = 'both registers have same number of orders';
let actual = isFirstComeFirstServed([1, 4, 5], [2, 3, 6], [1, 2, 3, 4, 5, 6]);
assertEquals(actual, true, desc);
desc = 'registers have different lengths';
actual = isFirstComeFirstServed([1, 5], [2, 3, 6], [1, 2, 6, 3, 5]);
assertEquals(actual, false, desc);
desc = 'one register is empty';
actual = isFirstComeFirstServed([], [2, 3, 6], [2, 3, 6]);
assertEquals(actual, true, desc);
desc = 'served orders is missing orders';
actual = isFirstComeFirstServed([1, 5], [2, 3, 6], [1, 6, 3, 5]);
assertEquals(actual, false, desc);
desc = 'served orders has extra orders';
actual = isFirstComeFirstServed([1, 5], [2, 3, 6], [1, 2, 3, 5, 6, 8]);
assertEquals(actual, false, desc);
desc = 'one register has extra orders';
actual = isFirstComeFirstServed([1, 9], [7, 8], [1, 7, 8]);
assertEquals(actual, false, desc);
desc = 'one register has unserved orders';
actual = isFirstComeFirstServed([55, 9], [7, 8], [1, 7, 8, 9]);
assertEquals(actual, false, desc);
desc = 'order numbers are not sequential';
actual = isFirstComeFirstServed([27, 12, 18], [55, 31, 8], [55, 31, 8, 27, 12, 18]);
assertEquals(actual, true, desc);
function assertEquals(a, b, desc) {
if (a === b) {
console.log(`${desc} ... PASS`);
} else {
console.log(`${desc} ... FAIL: ${a} != ${b}`);
}
}
/*
function isFirstComeFirstServed(takeOutOrders, dineInOrders, servedOrders) {
var takeOutOrdersIndex = 0;
var dineInOrdersIndex = 0;
var takeOutOrdersMaxIndex = takeOutOrders.length - 1;
var dineInOrdersMaxIndex = dineInOrders.length - 1;
for (var i = 0; i < servedOrders.length; i++) {
var order = servedOrders[i];
// if we still have orders in takeOutOrders
// and the current order in takeOutOrders is the same
// as the current order in servedOrders
if (takeOutOrdersIndex <= takeOutOrdersMaxIndex &&
order === takeOutOrders[takeOutOrdersIndex]) {
takeOutOrdersIndex++;
// if we still have orders in dineInOrders
// and the current order in dineInOrders is the same
// as the current order in servedOrders
} else if (dineInOrdersIndex <= dineInOrdersMaxIndex &&
order === dineInOrders[dineInOrdersIndex]) {
dineInOrdersIndex++;
// if the current order in servedOrders doesn't match the current
// order in takeOutOrders or dineInOrders, then we're not serving first-come,
// first-served
} else {
return false;
}
}
// check for any extra orders at the end of takeOutOrders or dineInOrders
if (dineInOrdersIndex != dineInOrders.length ||
takeOutOrdersIndex != takeOutOrders.length) {
return false;
}
// all orders in servedOrders have been "accounted for"
// so we're serving first-come, first-served!
return true;
}
*/