#java队列的实现

package 队;
import java.util.Queue;
import java.util.Scanner;
import java.util.LinkedList;


public class queue {
	public static void main(String[] args) {
		Scanner in=new Scanner(System.in);
		Queue<String> queue=new LinkedList<String>();
		while(true)
		{
		System.out.println("1.进队");
		System.out.println("2.出队");
		System.out.println("3.队是否为空");
		System.out.println("4.队首长度");
		System.out.println("5.退出");
		System.out.println("请选择");
		int x;
		
		x=in.nextInt();
		switch(x) {
		case 1:
			System.out.println("输入该队长度");
			int y=in.nextInt();
			System.out.println("请输入进队元素");
			String input;
			for(int i=0;i<y;i++)
			{
			input=in.next();
			queue.offer(input);
			}
		   
		    break;
		case 2:
			while(!queue.isEmpty())
			{
				System.out.println(queue.poll());
			}
			break;
		case 3:
			boolean ele;
			ele=queue.isEmpty();
			if(ele==true)
			{
				System.out.println("改队为空");
			}
			else {
				System.out.println("该队不为空");
			}
			break;
		case 4:
			System.out.println(queue.size());
			break;
		case 5:
			break;
			}
		
		
		}
		
	}
	

}