package datastructure;
/**
* 使用Javaæ³›åž‹å®žçŽ°æ ˆ
*
* @author liu yuning
*
* @param
*/
public class Stack {
private static class Node {
private U value;
private Node next;
public Node() {
value = null;
next = null;
}
public Node(U value, Node next) {
this.value = value;
this.next = next;
}
/**
* 判æ–æ ˆæ˜¯å¦ä¸ºç©º
*
* @return true 如果为空；å¦åˆ™ï¼Œfalse
*/
public boolean empty() {
return value == null && next == null;
}
}
/**
* å®šä¹‰æ ˆé¡¶å…ƒç´
*/
private Node top = new Node();
/**
* å…¥æ ˆæ“作
*
* @param value
* å…¥æ ˆå…ƒç´ çš„å€¼
*/
public void push(T value) {
top = new Node(value, top);
}
/**
* å‡ºæ ˆæ“作
*
* @return æ ˆé¡¶å…ƒç´ çš„å€¼
*/
public T pop() {
T value = top.value;
if (!top.empty()) {
top = top.next;
}
return value;
}
public static void main(String[] args) {
Stack stack = new Stack();
String string = "This is a test for stack";
System.out.println("å…¥æ ˆå…ƒç´ (String)ä¾æ¬¡ä¸ºï¼š");
for (String nodeIn : string.split(" ")) {
stack.push(nodeIn);
System.out.println(nodeIn);
}
System.out.println("å‡ºæ ˆå…ƒç´ (String)ä¾æ¬¡ä¸ºï¼š");
String nodeOut;
while ((nodeOut = stack.pop()) != null) {
System.out.println(nodeOut);
}
}
}