Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Appearance settings

Latest commit

 

History

History
History
57 lines (50 loc) · 1.2 KB

File metadata and controls

57 lines (50 loc) · 1.2 KB
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
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
import java.util.NoSuchElementException;
public class LinkedQueue implements Queue {
private class Node {
public Object data;
public Node next;
public Node(Object data, Node next) {
this.data = data;
this.next = next;
}
}
private Node head = null;
private Node tail = null;
public void enqueue(Object item) {
Node newNode = new Node(item, null);
if (isEmpty()) {
head = newNode;
}
else {
tail.next = newNode;
}
tail = newNode;
}
public Object dequeue() {
if (isEmpty()) {
throw new NoSuchElementException();
}
Object item = head.data;
if (tail == head) {
tail = null;
}
head = head.next;
return item;
}
public Object peek() {
if (head == null) {
throw new NoSuchElementException();
}
return head.data;
}
public boolean isEmpty() {
return head == null;
}
public int size() {
int count = 0;
for (Node node = head; node != null; node = node.next) {
count++;
}
return count;
}
}
Morty Proxy This is a proxified and sanitized view of the page, visit original site.