今天突然发现利用java语言特性能很方便的实现各类数据结构,不需要像c 或者c++管理指针。同样思考方法也很直接精巧。
package typeinfo.toys;
public class LinkedStack<T> {
private static class Node<U>{
U item;
Node<U> next;
public Node() {
item = null;
next = null;
}
public 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<>();
public void push(T item){
top = new Node<>(item ,top);
}
public T pop(){
T res = top.item;
if(!top.end()){
top = top.next;
}
return res;
}
public static void main(String[] args) {
LinkedStack<String> ls = new LinkedStack<>();
for(String s: "hello world tt love sai".split(" "))
{
ls.push(s);
}
String s;
while((s=ls.pop())!=null){
System.out.println(s);
}
}
}