java的集合框架实现栈，队列

package com.huowolf;

import java.util.Stack;

public class MyStack {

	public static void main(String[] args) {
		Stack<String> stack =new Stack<String> ();
		stack.add("first");
		stack.push("second");
		stack.push("third");
		stack.push("four");
		stack.push("five");
		System.out.println("Stack:"+stack);
		stack.pop();//删除栈顶元素
		stack.pop();
		System.out.println("Stack:"+stack);
		if(!stack.empty())	{
			System.out.println("peek_stack:"+stack.peek());//取得栈顶元素
		}
		int i=stack.search("first");
		System.out.println("first在栈中所处的位置："+i);//栈顶元素位置为1,以后依次递增1
		System.out.println(stack.size());
	}

}

package com.huowolf;

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

public class QueueDemo {

	public static void main(String[] args) {
		Queue<String> queue = new LinkedList<String>();
		queue.add("first");
		queue.add("second");
		queue.add("third");
		queue.add("four");
		queue.offer("five");
		System.out.println("Queue:"+queue);
		System.out.println("Queue_peek:"+queue.peek());//获取但不移除此队列的头
		System.out.println("Queue:"+queue);
		System.out.println("Queue_remove:"+queue.remove()); //获取并移除此队列的头
		System.out.println("Queue:"+queue);
	}

}