1: 先进先出 队列的实现:
first结点 负责出队
last结点 负责入队
package com.algorithm.common;
import java.util.Iterator;
import java.util.NoSuchElementException;
/**
* 先进先出队列
* @author lijunqing
* @param <Item>
*/
public class Queue<Item> implements Iterable<Item> {
private int N;
// 第一个节点
private Node first;
// 最后一个节点
private Node last;
private class Node {
private Item item;
private Node next;
}
public Queue() {
N=0;
first=null;
last=first;
}
/**
* 入队 新的Node就是last
* @param item
*/
public void enqueue(Item item) {
Node oldLast=last;
last=new Node();
last.item=item;
last.next=null;
if(isEmpty()) { // 空的時候 只有只有一个几点 first = list
first=last;
} else {
oldLast.next=last;
}
N++;
}
/**
* 出队
* @return
*/
public Item dequeue() {
if(isEmpty()) {
throw new NoSuchElementException();
}
Item item=first.item;
first=first.next;
N--;
return item;
}
public int size() {
return N;
}
public boolean isEmpty() {
if(first == null) {
return true;
}
return false;
}
@Override
public Iterator<Item> iterator() {
return new ListIterator();
}
private class ListIterator implements Iterator<Item> {
private Node current=first;
@Override
public boolean hasNext() {
return current != null;
}
@Override
public Item next() {
Item item=current.item;
current=current.next;
return item;
}
@Override
public void remove() {
throw new UnsupportedOperationException();
}
}
public static void main(String[] args){
Queue<String> q = new Queue<String>();
q.enqueue("123");
q.enqueue("3445");
q.enqueue("dddd");
System.out.println(q.dequeue()+" "+q.size());
Iterator<String> iterator = q.iterator();
while(iterator.hasNext()){
System.out.println(iterator.next());
}
}
}
结果:
123 2
3445
dddd