Stack of Integers

package com.mylearnings;

public class IntStack {

int size;
int[] stack;
int top;

IntStack() {
size = 50;
top = -1;
stack = new int[50];
}

IntStack(int size) {
this.size = size;
top = -1;
stack = new int[size];
}

public boolean push(int value) {

if (!isFull()) {
stack[++top] = value;
return true;
}
return false;
}

public int pop() {
return stack[top--];
}

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

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

}

----------------------------------------------------------------

Main class

package com.mylearnings;

public class IntStackMain {

public static void main(String[] args) {

IntStack stack = new IntStack(10);

stack.push(1);

stack.push(2);

stack.push(3);

stack.push(4);

System.out.println(stack.pop());

System.out.println(stack.pop());

System.out.println(stack.pop());

System.out.println(stack.pop());

}

}