pilha

package pilha;

public class Pilha {

    int[] elements;
    int top = 0;
    int remove = 0;

    public Pilha() {
        elements = new int[2];
    }

    public void push(int value) {
        if (!isFull()) {
            elements[top] = value;
            top++;
        } else {
            System.out.println("Quebrou");
        }
    }

    public int pop() {
        if (!isEmpty()) {
            remove = elements[--top];
            elements[top] = 0;
            return remove;
        } else {
            return -1;
        }
    }

    private boolean isFull() {
        if (top == elements.length)
            return true;

        return false;
    }

    private boolean isEmpty() {
        if (top == 0)
            return true;

        return false;
    }

}