public class StringStack  {
  
  private static final int defaultSize = 1000;
    
  private String [] data;
  private int numElements = 0;
  
  StringStack () {
    data = new String[defaultSize];
  }
  
  StringStack (int initialSize) {
    data = new String[initialSize];
  }
  
  public boolean isEmpty() {
    return (numElements == 0);
  }
  
  public void push(String c) {
    if (numElements == data.length) {
      String [] tmpData = new String [Math.max(2*data.length, 1)];
      for (int i = 0; i<numElements; i++)
        tmpData[i]=data[i];
      data = tmpData;
    }
      
    data[numElements++]=c;
  }
    
  public String pop () {
    String ret = data[--numElements];
    data[numElements] = null; // to prevent loitering -- i.e., to allow garbage collector to reclaim the space used by this String
    return ret;
  }
}