【转载】Java编程思想——LinkedList实现Stack

Java编程思想——LinkedList实现Stack

代码

```java
package Test01.holdobject;

import java.util.LinkedList;

class Stack<T> {
    private LinkedList<T> storage = new LinkedList<T>();
    public void push(T t){
    	storage.addFirst(t);
    }
    public T peek(){
    	return storage.getFirst();
    }
    public T poll(){
    	return storage.removeFirst();
    }
    public boolean isEmpty(){
    	return storage.isEmpty();
    }
    public String toString(){
    	return storage.toString();
    }
    public int size(){
    	return storage.size();
    }
	public static void main(String[] args) {
		Stack<Integer> stack = new  Stack<Integer>();
		for(int i = 0; i < 10; i++) {
			stack.push(i);
		} 
		int size = stack.size(); 
		System.out.println(size); 
		for(int i = 0;i < size; i++){
			System.out.println(stack.poll());
		}

	}

}