-
Notifications
You must be signed in to change notification settings - Fork 85
/
ArrayQueue.java
64 lines (53 loc) · 1.07 KB
/
ArrayQueue.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
package queue;
/**
* 动态数组实现队列
*
* @author ronglexie
* @version 2018/8/4
*/
public class ArrayQueue<E> implements Queue<E> {
private Array<E> array;
public ArrayQueue(int capacity){
array = new Array<>(capacity);
}
public ArrayQueue(){
array = new Array<>();
}
@Override
public int getSize() {
return array.getSize();
}
public int getCapacity(){
return array.getCapacity();
}
@Override
public boolean isEmpty() {
return array.isEmpty();
}
@Override
public void enqueue(E e) {
array.addLast(e);
}
@Override
public E dequeue() {
return array.removeFirst();
}
@Override
public E getFront() {
return array.getFirst();
}
@Override
public String toString() {
StringBuilder result = new StringBuilder();
result.append("Queue: size = %d , capacity = %d",array.getSize(),array.getCapacity());
result.append("front [");
for (int i = 0; i < array.getSize(); i++) {
result.append(array.get(i));
if(i != array.getSize() - 1){
result.append(", ");
}
}
result.append("] tail");
return result.toString();
}
}