How do I implement a stack in Java?

Can you help me understand how to implement a stack in Java?

Sure! A stack is a data structure that follows the Last In First Out (LIFO) principle. Would you like to see a code example?

Yes, please provide a simple code example.

Here's a basic implementation:

import java.util.EmptyStackException;

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) {
            throw new StackOverflowError();
        }
        stackArray[++top] = value;
    }

    public int pop() {
        if (isEmpty()) {
            throw new EmptyStackException();
        }
        return stackArray[top--];
    }

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

Would you like to know how to use this stack?

Yes, how can I use this stack implementation?

You can create a stack and use the push and pop methods like this:

public class Main {
    public static void main(String[] args) {
        Stack stack = new Stack(5);
        stack.push(10);
        stack.push(20);
        System.out.println(stack.pop()); // Outputs 20
    }
}