queue : FIFO(first in first out) 형태의 자료 구조
1
2
3
4
5
6
7
8
9
10
public class Node {
public Node next;
public int value;
public Node(int value) {
this.value = value;
}
}
queue의 기본 구성
1
2
3
4
5
6
public Queue(int value) {
Node node = new Node(value);
this.first = node;
this.last = node;
this.length++;
}
구현 메소드 목록
1
2
- void enqueue(int value)
- Node dequeue()
void enqueue(int value)
1
2
3
4
5
6
7
8
9
10
public void enqueue(int value) {
Node newNode = new Node(value);
if (this.length == 0) {
this.first = newNode;
} else {
newNode.next = this.last;
}
this.last = newNode;
this.length++;
}
Node dequeue()
1
2
3
4
5
6
7
8
9
10
11
12
public Node dequeue() {
if (this.length == 0) {
return null;
}
Node temp = this.first;
this.first = this.first.next;
this.length--;
if (this.length == 0) {
this.last = null;
}
return temp;
}