-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathQueue.java
More file actions
84 lines (43 loc) · 1.3 KB
/
Copy pathQueue.java
File metadata and controls
84 lines (43 loc) · 1.3 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
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
import java.util.ArrayList;
import java.util.LinkedList;
public class Queue {
private interface QueueDataStructure {
public void add(int item);
public int remove();
}
private static class Queue1 implements QueueDataStructure {
ArrayList<Integer> items;
public Queue1() {
items = new ArrayList<>();
}
public void add(int item) {
items.add(item);
}
public int remove() {
return items.remove(0);
}
}
private static class Queue2 implements QueueDataStructure {
java.util.Queue<Integer> items;
public Queue2() {
items = new LinkedList();
}
public void add(int item) {
items.add(item);
}
public int remove() {
return items.remove();
}
}
public static void main(String[] args) {
QueueDataStructure[] queueClasses = new QueueDataStructure[]{new Queue1(), new Queue2()};
for (QueueDataStructure queue : queueClasses) {
queue.add(1);
queue.add(2);
System.out.println(queue.remove());
queue.add(3);
System.out.println(queue.remove());
System.out.println("------");
}
}
}