Coursera_Algorithm class practice: Generic stack using fixed size array implementation

gistfile1.txt

public class MyArrayStack<Item>
{
  private Item[] s;
  private int index;
  
  public MyArrayStack(int capacity) {
    s = (Item[]) new Object[capacity];
    index = 0;
  }
  public boolean isEmpty() {
    return index == 0;
  }
  
  public void push(Item item) {
    s[index++] = item;
  }
  
  public Item pop() {
    if( index == 0 ) return null;
     return s[--index];    
  }
  
    public static void main(String[] args) {
    MyArrayStack<Integer> s1 =  new MyArrayStack<Integer>(5);
    
    s1.push(1);
    s1.push(2);
    s1.push(3);
    
    System.out.println(s1.pop());
    System.out.println(s1.pop());
    System.out.println(s1.pop());
    System.out.println(s1.pop());
    System.out.println(s1.isEmpty());

}
  
}