栈（stack）和队列（queue）的简单实例

版权声明：本文为博主原创文章，未经博主允许不得转载。 https://blog.csdn.net/qq_16524861/article/details/51614745

栈

import java.util.Stack;
public class StackClass {
       public static void main(String[] args) {
        Stack s=new Stack();
        s.push("A");
        s.push("B");
        s.push("C");
        s.push("D");
        s.push("E");
        System.out.println("压栈数据：");
        System.out.println(s);
        System.out.println("==============");
        System.out.println("出栈数据：");
        System.out.print(s.pop()+" ");
        System.out.print(s.pop()+" ");
        System.out.print(s.pop()+" ");
        System.out.print(s.pop()+" ");
        System.out.print(s.pop()+" ");
    } 

结果：

队列

import java.util.LinkedList;
import java.util.Queue;
public class QueueClass {
    public static void main(String[] args) {
        Queue<String> qu=new LinkedList<String>() ;
        System.out.println("添加数据：");
        qu.offer("A");
        qu.offer("B");
        qu.offer("C");
        qu.offer("D");
        qu.offer("E");

        for (String string : qu) {
            System.out.print(string+" ");
        }
        System.out.println();
        System.out.println("移除数据：");
        System.out.print(qu.poll()+" ");
        System.out.print(qu.poll()+" ");
        System.out.print(qu.poll()+" ");
        System.out.print(qu.poll()+" ");
        System.out.print(qu.poll()+" ");
    }


}

结果：