接口设计
int size();
boolean isEmpty();
boolean contains(E element);
void add(E element);
E get(int index);
E set(int index);
void add(int index, E element);
E remove(int index);
int indexOf(E element);
void clear();
代码实现
package DataStructure.arraylist;
public class ArrayList<E> {
private int size;
private E[] elments;
private static final int DEFAULT_CAPACITY = 10;
private static final int ELEMENT_NOT_FOUND = -1;
public ArrayList(int capacity) {
capacity = (capacity < DEFAULT_CAPACITY) ? DEFAULT_CAPACITY : capacity;
elments = (E[]) new Object[capacity];
}
public ArrayList() {
this(DEFAULT_CAPACITY);
}
public void clear() {
for (int i = 0; i < size; i++) {
elments[i] = null;
}
size = 0;
}
public int size() {
return size;
}
public boolean isEmpty() {
return size == 0;
}
public boolean contains(E element) {
return indexOf(element) != ELEMENT_NOT_FOUND;
}
public void add(E element) {
add(size, element);
}
public E get(int index) {
rangeCheck(index);
return elments[index];
}
public E set(int index, E element) {
rangeCheck(index);
E old = elments[index];
elments[index] = element;
return old;
}
public void add(int index, E element) {
rangeCheckForAdd(index);
ensureCapacity(size + 1);
for (int i = size; i > index; i--) {
elments[i] = elments[i - 1];
}
elments[index] = element;
size++;
}
public E remoeve(int index) {
rangeCheck(index);
E oldElement = elments[index];
for (int i = index + 1; i < size; i++) {
elments[i - 1] = elments[i];
}
elments[--size] = null;
return oldElement;
}
public int indexOf(E element) {
if (element == null) {
for (int i = 0; i < size; i++) {
if (elments[i] == null) {
return i;
}
}
} else {
for (int i = 0; i < size; i++) {
if (element.equals(elments[i])) {
return i;
}
}
}
return ELEMENT_NOT_FOUND;
}
private void ensureCapacity(int capacity) {
int oldCapacity = elments.length;
if (oldCapacity >= capacity) return;
int newCapacity = oldCapacity + (oldCapacity >> 1);
E[] newElements = (E[]) new Object[newCapacity];
for (int i = 0; i < size; i++) {
newElements[i] = elments[i];
}
elments = newElements;
System.out.println(oldCapacity + "扩容为:" + newCapacity);
}
private void outOfBounds(int index) {
throw new IndexOutOfBoundsException("Index: " + index + ", Size:" + size);
}
private void rangeCheck(int index) {
if (index < 0 || index >= size) {
outOfBounds(index);
}
}
private void rangeCheckForAdd(int index) {
if (index < 0 || index > size) {
outOfBounds(index);
}
}
@Override
public String toString() {
StringBuilder string = new StringBuilder();
string.append("size=").append(size).append(", [");
for (int i = 0; i < size; i++) {
if (i != 0) {
string.append(", ");
}
string.append(elments[i]);
}
string.append("]");
return string.toString();
}
}