简单实现数组
public class Array<E> {
private E[] array;
private int size;
public Array(){
this(10);
}
public Array(int capacity){
array = (E[])new Object[capacity];
}
public void add(E e){
array[size++] = e;
}
public E remove(int index){
E arr = array[index];
for(int i = index;i < size;i++)
array[i] = array[i+1];
size--;
return arr;
}
public boolean contains(E e){
for(int i = 0;i < size; i++){
if(array[i].equals(e))
return true;
}
return false;
}
public int indexOf(E e){
for(int i = 0;i < size;i++)
if(array[i] == e)
return i;
return -1;
}
public E get(int index){
if(index < 0|| index >= size)
throw new IllegalArgumentException();
return array[index];
}
public boolean isEmpty(){
return size==0;
}
public int size(){
return size;
}