Repository navigation
Expand file tree
/
Copy pathSimpleLinkedQueque.java
More file actions
108 lines (93 loc) · 2.49 KB
/
Copy pathSimpleLinkedQueque.java
File metadata and controls
108 lines (93 loc) · 2.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
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
package queue;
import java.util.Iterator;
public class SimpleLinkedQueque<V> implements SimpleQueue<V>, Iterable<V> {
private int size = 0;
private Node firstNode = null;
private Node lastNode = null;
@Override
public boolean add(V object) {
if (firstNode == null) {
Node newNode = new Node(object);
firstNode = newNode;
lastNode = newNode;
size++;
return true;
} else {
Node newNode = new Node(object);
lastNode.setBehind(newNode);
lastNode = newNode;
size++;
return true;
}
}
@Override
public V peek() {
if (firstNode != null) {
return firstNode.getValue();
}
throw new RuntimeException();
}
@Override
public V poll() {
if (firstNode != null) {
if (firstNode.getBehind() == null) {
V value = firstNode.getValue();
firstNode = null;
lastNode = null;
size--;
return value;
} else {
V value = firstNode.getValue();
Node newFirstNode = firstNode.getBehind();
firstNode = newFirstNode;
size--;
return value;
}
}
throw new RuntimeException();
}
@Override
public int size() {
return size;
}
@Override
public Iterator<V> iterator() {
return new Iterator<V>() {
Node cursor = firstNode;
@Override
public boolean hasNext() {
if (cursor != null) {
return true;
} else {
return false;
}
}
@Override
public V next() {
if (hasNext()) {
V value = cursor.getValue();
Node newNode = cursor.getBehind();
cursor = newNode;
return value;
}
throw new RuntimeException();
}
};
}
private class Node {
private V value;
private Node behind;
Node(V value) {
this.value = value;
}
private V getValue() {
return value;
}
private void setBehind(Node node) {
this.behind = node;
}
private Node getBehind() {
return behind;
}
}
}