数据结构与算法—2、动态数组ArrayStack

一、定义接口

package p1.接口;

/**
 * @Auther: wjw
 * @Date: 2022/1/9-01-09-14:39
 * @Description: p1.接口
 * @version: 1.0
 */
public interface Stack<E> extends Iterable<E> {
    public int size();
    public boolean isEmpty();
    //入栈
    public void push(E element);
    //出栈
    public E pop();
    //查看当前栈顶元素
    public E peek();
    public void clear();
}

二、通过ArrayStack类来实现接口对应功能

package p2.线性结构;

import p1.接口.Stack;

import java.lang.reflect.Array;
import java.util.Iterator;

/**
 * @Auther: wjw
 * @Date: 2022/1/9-01-09-14:42
 * @Description: p2.线性结构
 * @version: 1.0
 */
public class ArrayStack<E> implements Stack<E> {
    private ArrayList<E> list;

    public ArrayStack() {
        list = new ArrayList<>();
    }

    public ArrayStack(int capacity) {
        list = new ArrayList<>(capacity);
    }

    @Override
    public int size() {
        return list.size();
    }

    @Override
    public boolean isEmpty() {
        return list.isEmpty();
    }

    @Override
    public void push(E element) {
        list.add(element);
    }

    @Override
    public E pop() {
        return list.remove(list.size()-1);
    }

    @Override
    public E peek() {
        return list.get(list.size()-1);
    }

    @Override
    public void clear() {
        list.clear();
    }

    @Override
    public Iterator<E> iterator() {
        return list.iterator();
    }

    @Override
    public String toString(){
        return list.toString();
    }

    @Override
    public boolean equals(Object o){
        if (o == null) {
            return false;
        }
        if (this == o){
            return true;
        }
        if (o instanceof ArrayStack) {
            ArrayStack other = (ArrayStack) o;
           return this.list.equals(other.list);
        }
        return false;
    }
}

三、测试类

package p2.线性结构;

import com.sun.org.apache.bcel.internal.generic.POP;
import com.sun.org.apache.xerces.internal.dom.PSVIDocumentImpl;

import java.sql.SQLOutput;

/**
 * @Auther: wjw
 * @Date: 2022/1/9-01-09-15:05
 * @Description: p2.线性结构
 * @version: 1.0
 */
public class TestStack {
    public static void main(String[] args) {
        ArrayStack<Integer> stack01 = new ArrayStack<>();
        ArrayStack<Integer> stack02 = new ArrayStack<>(15);
        for (int i = 0; i <=13 ; i++) {
            stack01.push(i);
            stack02.push(i);
        }
        System.out.println(stack01);
        stack01.pop();
        stack01.push(23);
        System.out.println(stack01);
        System.out.println(stack01.size());
        System.out.println(stack02.size());

    }
}