How can I implement a dynamic stack in Java?

How can I implement a dynamic stack in Java?

To implement a dynamic stack in Java, you can use an array or a linked list. Would you like a code example?

Yes, please provide a code example using an array.

Here's a simple implementation using an array:

class DynamicStack {
    private int[] stack;
    private int top;
    private int capacity;

    public DynamicStack(int size) {
        stack = new int[size];
        capacity = size;
        top = -1;
    }

    public void push(int value) {
        if (top == capacity - 1) {
            resize();
        }
        stack[++top] = value;
    }

    private void resize() {
        capacity *= 2;
        int[] newStack = new int[capacity];
        System.arraycopy(stack, 0, newStack, 0, stack.length);
        stack = newStack;
    }

    public int pop() {
        if (top == -1) throw new EmptyStackException();
        return stack[top--];
    }
}

This code defines a dynamic stack that resizes when full.

What if I want to implement it using a linked list?

Using a linked list is a great choice for a dynamic stack. Here's a simple implementation:

class Node {
    int data;
    Node next;
    Node(int data) {
        this.data = data;
    }
}

class LinkedListStack {
    private Node top;

    public void push(int value) {
        Node newNode = new Node(value);
        newNode.next = top;
        top = newNode;
    }

    public int pop() {
        if (top == null) throw new EmptyStackException();
        int value = top.data;
        top = top.next;
        return value;
    }
}

This implementation uses a linked list to manage the stack.