import java.io.*; import java.util.*; public class stringList { private String[] data; private int numItems; public stringList() { data = new String[5]; numItems=0; } public boolean isFull() { return numItems >= data.length; } public void grow() { // "grow" the array by creating a new one and copying over String[] tmpArray = new String[data.length+data.length/2]; for (int i=0;i<data.length;i++) tmpArray[i]=data[i]; data = tmpArray; } public void add(String d) { if (isFull()){ grow(); } data[numItems]=d; numItems = numItems + 1; } public String toString() { String s = Arrays.toString(data)+" : "+numItems; return s; } public void add(int pos, String d){ if (data.length<=numItems) grow(); for (int i = numItems;i > pos;i--){ data[i]=data[i-1]; } data[pos]=d; numItems = numItems+1; } public String remove(int pos) { String temp = data[pos]; for(int i= pos; i < numItems; i++){ data[i] = data[i+1]; } numItems--; return temp; } public int size() { return numItems; } public String get(int pos) { return data[pos]; } public void set(int pos, String d) { data[pos] = d; } public String find(String n) { for(int i = 0; i < numItems; i++) { if(data[i].equals(n)) { return data[i]; } } return null; } public void fremove(String n) { for(int i = 0; i < numItems; i++) { if(data[i].equals(n)) { remove(i); } } } }