package Collection;
import java.util.LinkedList;
/*
* è‡ªå®šçš„æ ˆ
* LinkedListå…·æœ‰æ»¡è¶³æ ˆè¦æ±‚çš„æ‰€æœ‰æ–¹æ³•ï¼Œå› æ¤å¯ä»¥ç”¨LinkedListç›´æŽ¥å®žçŽ°æ ˆ
*
*ä¸ç›´æŽ¥ç»§æ‰¿LinkedListç±»ï¼šå› ä¸ºè¿™æ ·ä¼šäº§ç”Ÿå…·æœ‰LinkedList的其他所有方法的类
*
* */
public class Stack {
private LinkedList linkedList=null;
public Stack(){
//linkedListæ— é™å¤§ï¼Œæ— 法创建一个具有固定大å°çš„linkedList
linkedList=new LinkedList();
}
//è¿”å›žæ ˆä½Žï¼ˆè¡¨å¤´ï¼‰å…ƒç´ ï¼Œå…ƒç´ è¿˜å˜åœ¨
public T peek(){
return linkedList.peek();
}
//å–å‡ºæ ˆé¡¶ï¼ˆè¡¨å°¾ï¼‰å…ƒç´ ï¼Œå…ƒç´ å–出
public T pop(){
return linkedList.poll();
}
//åŠ å…¥å…ƒç´
public void push(T element){
linkedList.addFirst(element);
}
public boolean isEmpty(){
return linkedList.isEmpty();
}
public int length(){
return linkedList.size();
}
//销æ¯æ ˆ
public void DestroyStack() {
if(linkedList==null)
return;
while(!linkedList.isEmpty()) {
linkedList.pop();
}
}
public String toString(){
return linkedList.toString();
}
}