/*用链表实现栈--链栈

  * */

 public class MyLinkedStack {

     public MyLinkedList linklist;

     int items;

     public MyLinkedStack() {

         items = 0;

         linklist = new MyLinkedList();

     }

     public boolean isEmpty(){

         return linklist.isEmpty();

     }

     public void push(int key){

         linklist.insertFirst(key);

         items++;

     }

     public Link pop(){

         Link temp = linklist.deleteFirst();

         items--;

         return temp;

     }

     public void diaplayStack(){

         System.out.println("stack--top--to--bottom");

         linklist.displayLinkedList();

     }

     public int size(){

         return items;

     }

     public Link getTop(){

         return linklist.deleteFirst();

     }

     public static void main(String[] args) {

         MyLinkedStack  stack = new MyLinkedStack ();

         for(int i = 0; i < 7; i++){

             stack.push(i);

         }

         stack.diaplayStack();

         stack.pop();

         stack.diaplayStack();

         System.out.println(stack.size());

     }

 }