【数据结构】栈链表/数组实现 java语言

SurfingMaster

已于 2023-09-05 16:42:30 修改

阅读量260

点赞数

分类专栏：数据结构文章标签：数据结构 java 字符串栈

于 2021-02-21 17:00:25 首次发布

本文链接：https://blog.csdn.net/weixin_43275385/article/details/113917834

版权

数据结构专栏收录该内容

8 篇文章 0 订阅

订阅专栏

这篇博客介绍了如何使用Java实现栈的数据结构，分别提供了基于数组和链表的两种实现方式。ArrayStack类利用数组进行存储，当栈满时会返回false，而LinkedListStack类则使用链表节点存储元素，支持动态扩容。两个类都实现了Stack接口，提供了push、pop、peek、isEmpty和isFull等方法，并且实现了Iterable接口，支持迭代操作。

摘要由CSDN通过智能技术生成

链表/数组实现栈 java语言

接口定义

public interface Stack<E> {

    boolean push(E val);

    E pop();

    E peek();

    boolean isEmpty();

    boolean isFull();

}

数组实现

public class ArrayStack<E> implements Stack<E>, Iterable<E> {

    private E[] arr;

    private int top = 0; 

    @SuppressWarnings("all")
    public ArrayStack(int capacity) {
        this.arr = (E[]) new Object[capacity];
    }

    @Override
    public boolean push(E val) {
        if (isFull()) return false;
        arr[top++] = val;
        return true;
    }

    @Override
    public E pop() {
        if (isEmpty()) return null;
        E res = arr[--top];
        arr[top] = null;
        return res;
    }

    @Override
    public E peek() {
        if (isEmpty()) {
            return null;
        }
        return arr[top - 1];
    }

    @Override
    public boolean isEmpty() {
        return top == 0;
    }

    @Override
    public boolean isFull() { 
        return top == this.arr.length; 
    }
    // TODO 扩容

    @Override
    public Iterator<E> iterator() {

        return new Iterator<E>() {
            int p = top;

            @Override
            public boolean hasNext() {
                return p > 0;
            }

            @Override
            public E next() {
                return arr[--p];
            }
        };
    }
    
}

链表实现

public class LinkedListStack<E> implements Stack<E>, Iterable<E> {

    private int capacity = Integer.MAX_VALUE;
    private int size;
    private final Node<E> head = new Node<>(null, null);

    public LinkedListStack() {
    }

    public LinkedListStack(int capacity) {
        this.capacity = capacity;
    }


    @Override
    public boolean push(E val) {
        if (isFull()) {
            return false;
        }
        head.next = new Node<>(val, head.next);
        size++;
        return true;
    }


    @Override
    public E pop() {
        if (isEmpty()) {
            return null;
        }
        Node<E> first = head.next;
        head.next = first.next;
        size--;
        return first.value;
    }

    @Override
    public E peek() {
        if (isEmpty()) {
            return null;
        }
        return head.next.value;
    }

    @Override
    public boolean isEmpty() {
        return size == 0;
    }

    @Override
    public boolean isFull() {
        return size == capacity;
    }

    @Override
    public Iterator<E> iterator() {
        return new Iterator<E>() {
            Node<E> p = head.next;

            @Override
            public boolean hasNext() {
                return p != null;
            }

            @Override
            public E next() {
                E value = p.value;
                p = p.next;
                return value;
            }
        };
    }

    static class Node<E> {
        E value;
        Node<E> next;

        public Node(E value, Node<E> next) {
            this.value = value;
            this.next = next;
        }
    }

}