package tuple;
/**
* 泛型实现的栈,FILO
* @author Youjie
*
* @param <T>
*/
public class LinkedStack<T> {
private static class Node<U> {
U item;
Node<U> next;
public Node(U item, Node<U> next) {
this.item = item;
this.next = next;
}
public Node() {
this.item = null;
this.next = null;
}
boolean end(){return item == null && next == null;}
}
private Node<T> top = new Node<T>();
public void push(T item){
top = new Node<T>(item, top);
}
public T pop(){
T result = top.item;
if(!top.end()){
top = top.next;
}
return result;
}
public static void main(String[] args) {
LinkedStack<String> lss = new LinkedStack<String>();
for(String s : "a,b,c,d,e".split(",")){
lss.push(s);
}
String s;
while((s=lss.pop())!=null){
System.out.println(s);
}
}
}