Java栈和队列

1.栈----------先进后出

Stack

import java.util.LinkedList;
import java.util.Queue;
import java.util.Stack;


public class Test {
	public static void main(String[] args) {
			Stack stack=new Stack();
	        //1.empty()栈是否为空
	        System.out.println(stack.empty());
	        
	        //2.peek()栈顶值   
	        //3.进栈push()
	        stack.push(new Integer(1));
	        stack.push("b");
	        stack.push("c");
	        System.out.println("---------");
	        for (Object object : stack) {
				System.out.println(object);
			}
	        System.out.println("---------");
	        System.out.println("peek()栈顶值  ："+stack.peek());
	        
	        //4.pop()出栈
	        System.out.println(stack.pop());
	        System.out.println(stack.peek());
	        System.out.println("---------");
            
	        for (Object object : stack) {
				System.out.println(object);
			}
		}
}

2.队列-----------先进先出

Queue

import java.util.LinkedList;
import java.util.Queue;
import java.util.Stack;

public class Test {
	public static void main(String[] args) {
	Queue<String> queue = new LinkedList<String>();
	        //添加元素
	        queue.offer("1");
	        queue.offer("b");
	        queue.offer("c");
	      
	        for(String q : queue){
	            System.out.println(q);
	        }
	        System.out.println("===");
	        System.out.println("poll="+queue.poll()); //返回第一个元素，并在队列中删除
	        for(String q : queue){
	            System.out.println(q);
	        }
	        System.out.println("===");
	        System.out.println("element="+queue.element()); //返回第一个元素 
	        for(String q : queue){
	            System.out.println(q);
	        }
	        System.out.println("===");
	        System.out.println("peek="+queue.peek()); //返回第一个元素 
	        for(String q : queue){
	            System.out.println(q);
	        }
	}
}