-
Notifications
You must be signed in to change notification settings - Fork 3
Expand file tree
/
Copy pathDequeTester.java
More file actions
49 lines (42 loc) · 1.49 KB
/
Copy pathDequeTester.java
File metadata and controls
49 lines (42 loc) · 1.49 KB
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
/*
Team Yahoo Search -- Bing Li, Lily Yan, Selina Zou
APCS2 pd1
Lab 02
2018-04-18
*/
public class DequeTester {
public static void main(String[] args) {
QQKachoo<String> mister = new QQKachoo<String>();
System.out.println("\nEnqueueing deque mister...");
mister.addLast("and");
mister.addLast("there's");
mister.addLast("nobody");
mister.addLast("around");
mister.addFirst("forest");
mister.addFirst("a");
mister.addFirst("in");
mister.addFirst("falling");
mister.addFirst("you're");
mister.addFirst("when");
//System.out.println("\nmister after enqueing: " + mister);
System.out.println("\n\nDequeueing mister: ");
while (mister.size() > 0) {
int firstOrLast = (int)(Math.random() * 2); //determines whether to remove element at front or end of deque
if (firstOrLast == 0) {
System.out.println("\nRemoving element at FRONT of deque...");
System.out.println("Element at front: " + mister.peekFirst());
System.out.println("Element at front: " + mister.getFirst());
System.out.println("Element removed: " + mister.removeFirst());
}
else {
System.out.println("\nRemoving element at END of deque...");
System.out.println("Element at end: " + mister.peekLast());
System.out.println("Element at end: " + mister.getLast());
System.out.println("Element removed: " + mister.removeLast());
}
//System.out.println("Deque after dequeue: " + mister);
}
/* ~~~~~~~~~~~~MOVE ME DOWN~~~~~~~~~~~~~
~~~~~~~~~~~~YOU MADE IT~~~~~~~~~~~~~~~ */
}
}