数据结构(Java)之栈(2)-栈的基本实现

首先创建一个接口

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(){
        this(10);
    }
    public ArrayStack(int capacity){
        array = new Array<>(capacity);
    }
    @Override
    public int getSize() {
        return array.getSize();
    }

    @Override
    public boolean isEmpty() {
        return array.isEmpty();
    }
    public int getCapacity(){
        return array.getCapacity();
    }
    @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:");
        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();
    }
}

main方法测试

public static void main(String[] args) {
        ArrayStack<Integer> stack = new ArrayStack<>();
        for (int i = 0; i <5; i++) {
            stack.push(i);
            System.out.println(stack);
        }
        stack.pop();
        System.out.println(stack);
    }

结果展示