Java 实现Stack数据结构-学习记录

?

1 2 3 4 5 6 7 8 9 10 11 12 13 14

package stack;   /**  * @Title: Stack  * @ProjectName Demo03  * @date 2018/9/12  */ public interface Stack<E> {     int getSize();     boolean isEmpty();     void push(E e);     E pop();     E peek(); }

　　

?

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69

package stack;   import array.Array;   /**  * @Title: ArrayStack  * @ProjectName Demo03  * @date 2018/9/12  */ public class ArrayStack<E> implements Stack<E> {     private Array<E> array;     public ArrayStack() {         array = new Array<>();     }       public ArrayStack(int capacity) {         array = new Array<>(capacity);     }     @Override     public int getSize() {         return array.getSize();     }       @Override     public boolean isEmpty() {         return array.isEmpty();     }       @Override     public void push(E e) {         array.addLast(e);     }       @Override     public E pop() {         return array.removeLast();     }       @Override     public E peek() {         return array.getLast();     }       @Override     public String toString() {         StringBuilder res = new StringBuilder();         res.append("Stack: [");         for (int i = 0; i < array.getSize(); i++) {             res.append(array.get(i));             if (i != array.getSize() - 1) {                 res.append(",");             }         }         res.append("] top");         return res.toString();     }       public static void main(String[] args) {         ArrayStack<String> arrayStack = new ArrayStack<>();         arrayStack.push("a");         arrayStack.push("b");         arrayStack.push("c");         System.out.println(arrayStack);         String pop = arrayStack.pop();         System.out.println(pop);         System.out.println(arrayStack);         System.out.println(arrayStack.peek());     } }