链表-D-链表实现栈

package e_link.D_stack;


public class Link {
public long data;
public Link next;


public Link(long d) {
data = d;
}
public void displayLink(){
System.out.println(data);
}
}package e_link.D_stack;


public class LinkList {
private Link first;


public LinkList() {
first = null;
}


public boolean isEmpty() {
return first == null;
}


public void insertFirst(long dd) {
Link link = new Link(dd);
link.next = first;
first = link;
}


public long deleteFirst() {
Link current = first;
first = first.next;
return current.data;
}
public void displaysList(){
Link current=first;
while(current!=null){
current.displayLink();
current=current.next;
}
}


}package e_link.D_stack;


public class LinkStack {
private LinkList theList;


public LinkStack() {
theList = new LinkList();
}


public void push(long j) {
theList.insertFirst(j);
}


public long pop() {
return theList.deleteFirst();


}
public boolean isEmpty(){
return theList.isEmpty();
}
public void displayStack(){
theList.displaysList();
}
}package e_link.D_stack;


/**
 * 链表实现栈
 * 
 * @author Administrator
 *
 */
public class LinkStackApp {
public static void main(String[] args) {
LinkStack linkStack = new LinkStack();
linkStack.push(10);
linkStack.push(20);
linkStack.push(30);
linkStack.push(40);


linkStack.displayStack();


linkStack.pop();
linkStack.push(70);
linkStack.push(40);
System.out.println("-----");
linkStack.displayStack();


linkStack.pop();
linkStack.pop();
System.out.println("-----");
linkStack.displayStack();
}
}