队列

package luyunzhou.one;

import java.awt.EventQueue;
import java.util.Scanner;

public class QueueDemo {

    public static void main(String[] args) {
        // TODO Auto-generated method stub
        Scanner scanner = new Scanner(System.in);
        queue<String> que = new queue<String>();
        for (int i = 0; i < 5; i++) {
            que.enqueue(scanner.next());
        }
        que.find(3);
        int i = 0;
        while(i < 5){
            System.out.println(que.dequeue());
            i++;
        }

    }

}
class queue<Item>{
    private Node last;
    private Node first;
    private int N;
    private class Node{
        Item item;
        Node next;
    }
    public boolean IsEmpty() {
        return first == null;
    }
    public int size() {
        return N;
    }
    public void find(int k) {
        for (int i = 0; i < k-1; i++) {
            first = first.next;
        }
        System.out.println(first.item);
    }
    public void enqueue(Item item) {
        Node oldlast = last;
        last = new Node();
        last.item = item;
        if(IsEmpty())
            first = last;
        else
            oldlast.next = last;
        N++;
    }
    public Item dequeue(){
        Item item = first.item;
        first = first.next;
        N--;
        if(IsEmpty())
            last = null;
        return item;
    }
}