动态数组
package com.mj;
public class ArrayList {
private int size;
private int[] elements;
private static final int DEFAULT_CAPACITY = 10;
private static final int ELEMENT_NOT_FOUND = -1;
public ArrayList(int capaticy){
capaticy = (capaticy < DEFAULT_CAPACITY) ? DEFAULT_CAPACITY : capaticy;
elements = new int[capaticy];
}
public ArrayList(){
this(DEFAULT_CAPACITY);
}
public void clear(){
size = 0;
}
public int size(){
return size;
}
public boolean isEmpty(){
if(size == 0){
return true;
}else{
return false;
}
}
public boolean contains(int element){
return indexOf(element) != ELEMENT_NOT_FOUND;
}
public void add(int element){
}
public int get(int index){
if(index < 0 || index >=size){
throw new IndexOutOfBoundsException("Index:" + index + ", Size:" + size);
}
return elements[index];
}
public int set(int index,int element){
if(index < 0 || index >=size){
throw new IndexOutOfBoundsException("Index:" + index + ", Size:" + size);
}
int old = elements[index];
elements[index] = element;
return old;
}
public void add(int index ,int element){
}
public int remove(int index){
return 0;
}
public int indexOf(int element){
for(int i = 0;i < size; i++){
if(elements[i] == element){
return i;
}
}
return ELEMENT_NOT_FOUND;
}
}