How can I implement a stack in Java?

How can I implement a stack in Java?

You can implement a stack in Java using an array or a linked list. Which method would you prefer?

Let's go with the array implementation.

Great choice! You can create a class Stack with an array to hold the elements, and methods like push, pop, and peek. Would you like to see a code example?

Yes, please show me the code for that.

Here's a simple implementation:

class Stack {
    private int maxSize;
    private int[] stackArray;
    private int top;

    public Stack(int size) {
        maxSize = size;
        stackArray = new int[maxSize];
        top = -1;
    }

    public void push(int value) {
        if (top < maxSize - 1) {
            stackArray[++top] = value;
        } else {
            System.out.println("Stack is full!");
        }
    }

    public int pop() {
        if (top >= 0) {
            return stackArray[top--];
        } else {
            System.out.println("Stack is empty!");
            return -1;
        }
    }

    public int peek() {
        if (top >= 0) {
            return stackArray[top];
        } else {
            System.out.println("Stack is empty!");
            return -1;
        }
    }
}

Would you like to know how to use this stack?