一、代码如下
/**
*传统的下拉堆栈——内部链式存储机制
*/
public class LinkedStack<T> {
private static class Node<U>{
U item;
Node<U> next;
Node(){
item = null;
next = null;
}
Node(U item,Node<U> next){
this.item = item;
this.next = next;
}
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 top(){
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 : "Hello I am Gongyl".split(" "))
lss.push(s);
String s;
while((s = lss.top())!=null){
System.out.println(s);
}
}
}
二、一开始没看懂。就顺着逻辑捋了一下。(其中,top每变一次,就换一个代号。)