Java中的封装类----Queue和Stack相应操作

import java.util.*;

public class test1{
    public  static void  main(String []args)
    {
        Stack<Integer> stack=new Stack<Integer>();
        Queue<Integer> queue=new LinkedList<>();
        Scanner input=new Scanner(System.in);
        /*栈操作*/
          for(int i=1;i<=9;i++)
            stack.push(i);//入栈
        System.out.println("栈操作");
        for(int i:stack)
            System.out.print(i+" ");
        System.out.println();
           int b=stack.pop();
        for(int i:stack)
            System.out.print(i+" ");
        System.out.println();
        System.out.println(b);

        /*队列操作*/
        System.out.println("队列操作");
        for(int i=0;i<=9;i++)
            queue.offer(i);//入队
        for(int i:queue)
            System.out.print(i+" ");
        System.out.println();
           b=queue.poll();//返回并弹出队首元素
        for(int i:stack)
            System.out.print(i+" ");
        System.out.println();
        System.out.println(b);
    }
}