数据结构-4-栈

最新推荐文章于 2024-07-09 18:04:44 发布

loetca

最新推荐文章于 2024-07-09 18:04:44 发布

阅读量136

点赞数

分类专栏：数据结构文章标签：数据结构栈 stack 内存优化 java

本文链接：https://blog.csdn.net/adsl624153/article/details/103865915

版权

本文介绍了栈的数据结构，包括概念、常用方法和示例。重点讨论了栈在中缀、前缀和后缀表达式计算中的应用，详细阐述了如何通过栈来转换和计算这些表达式。

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

四、栈

1、概念

栈和队列类似，不同的是栈遵循 LIFO（last-in-first-out）的原则，即最后一个入栈的元素，最先被取出

来

2、常用方法

push。入栈
pop。出栈
peek。看一下栈顶的元素

3、示例

【1】数组栈

class ArrayStack<T> {
   
    private final int length;
    private Object[] array;
    private int top; // 指向栈顶的前一个位置

    public ArrayStack(int length) {
   
        this.length = length;
        this.array = new Object[this.length];
        this.top = -1;
    }

    public void push(T element) {
   
        if (isFull()) {
   
            return;
        }

        array[++top] = element;
    }

    @SuppressWarnings("unchecked")
    public T pop() {
   
        if (isEmpty()) {
   
            return null;
        }

        return (T)array[top--];
    }

    @SuppressWarnings("unchecked")
    public T peek() {
   
        if (isEmpty()) {
   
            return null;
        }

        return (T)array[top];
    }

    public boolean isFull() {
   
        return top == length - 1;
    }

    public boolean isEmpty() {
   
        return top == -1;
    }

    @Override
    public String toString() {
   
        if (isEmpty()) {
   
            return "[]";
        }

        StringBuilder sBuilder = new StringBuilder("[");
        for (int i = top; i > 0; i--) {
   
            sBuilder.append(array[i]).append(',').append(' ');
        }
        sBuilder.append(array[0]).append(']');
        return sBuilder.toString();
    }

}

【2】链表栈

class LinkedStack<T> {
   
    private final int length;
    private Node<T> top;
    private int size;

    public LinkedStack(int length) {
   
        this.length = length;
        this.top = null;
        this.size = 0;
    }

    public void push(T element) {
   
        if (isFull()) {
   
            return;
        }

        Node<T> add = new Node<T>(element);
        add.next = top;
        top = add;
        this.size++;
    }

    public T pop() {
   
        if (isEmpty()) {
   
            return null;
        }

        Node<T> node = this.top;
        this.top = node.next;
        this.size--;
        return node.element;
    }

    public T peek() {
   
        if (isEmpty()) {
   
            return null;
        }

        return this.top.element;
    }

    public boolean isFull() {
   
        return size == length;
    }

    public boolean isEmpty() {
   
        return this.top == null;
    }

    private static class Node<T> {
   
        private T element;
        private Node<T> next;

        public Node(T element) {
   
            this.element = element;
        }

        @Override
        public String toString() {
   
            return (null != element) ? element.toString() : "null";
        }
    }

    @Override
    public String toString() {
   
        if (isEmpty()) {
   
            return "[]";
        }

        StringBuilder sBuilder = new StringBuilder("[");
        Node<T> node = this.top;
        while (true) {
   
            sBuilder.append(node.element);
            if (null == node.next) {
   
                break;
            }
            node = node.next;
            sBuilder.append(',').append(' ');
        }
        sBuilder.append(']');
        return sBuilder.toString();
    }

}