java數據結構之動態數組實現棧

接口

public interface Stack <E>{
    int getSize();
    boolean isEmpty();
    void push(E e);
    E pop();
    E peek();
}

棧

public class ArrayStack<E> implements Stack<E> {
    Array<E> array;
/***************構造函數**************/
    public ArrayStack(int Capacity){
        array = new Array<>(Capacity);
    }
    public ArrayStack(){
        this(0);
    }
//獲得棧大小
    public int getSize(){
        return array.getSize();
    }
    //判斷棧是否爲空
    public boolean isEmpty(){
        return array.isEmpty();
    }
    //獲得棧容積
    public int getCapacity(){
        return array.getCapacity();
    }
    //入棧
    public void push(E e){
        array.addLast(e);
    }
    //出棧
    public E pop(){
        return array.removeLast(e);
    }
    //查看棧頂top元素
    public E peek(E){
        return array.getLast()
    }

     @Override
    public String toString() {
        StringBuilder res = new StringBuilder();
        res.append("Stack:");
        res.append('[');
        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();
    }
}

時間複雜度

int getSize();//O(1)
boolean isEmpty();//O(1)
void push(E e);//均攤O(1)
E pop();//均攤O(1)
E peek();//O(1)