使用Array实现Stack的Java程序

最新推荐文章于 2024-12-01 23:53:54 发布

转载最新推荐文章于 2024-12-01 23:53:54 发布 · 578 阅读

0 ·

CC 4.0 BY-SA版权

原文链接：https://java2blog.com/implement-stack-using-array-in-java/

Coding 专栏收录该内容

10 篇文章

订阅专栏

本文介绍了一个自定义的栈数据结构实现，包括push、pop、peek等核心操作，并演示了其在Java中的使用。

public class StackCustom {

    int size;
    int arr[];
    int top;

    public StackCustom(int size) {
        this.size = size;
        this.arr = new int[size];
        this.top = -1;
    }

    public void push(int pushedElement) {
        if (!isFull()) {
            top++;
            arr[top] = pushedElement;
        } else {
            System.out.println("Stack is full");
        }
    }

    public int pop() {
        if (!isEmpty()) {
            int returnTop = top;
            top--;
            System.out.println("Popped element: " + arr[returnTop]);
            return arr[returnTop];
        } else {
            System.out.println("Stack is empty!");
            return -1;
        }
    }

    public int peek() {
        if (!this.isEmpty()) {
            return arr[top];
        }else {
            System.out.println("Stack is empty!");
            return -1;
        }
    }

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

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


    public static void main(String[] args) {
        StackCustom stackCustom = new StackCustom(10);
        stackCustom.pop();
        System.out.println("=====================");
        stackCustom.push(10);
        stackCustom.push(30);
        stackCustom.push(50);
        stackCustom.push(40);
        System.out.println("=====================");
        stackCustom.pop();
        stackCustom.pop();
        stackCustom.pop();
        System.out.println("=====================");

    }


}