import java.util.Arrays;
public class ArrayListDemo {
private static final Object[] DEFAULTCAPACITY_EMPTY_ELEMENTDATA = {};
private static final int DEFAULT_CAPACITY = 10;
protected transient int modCount = 0;
transient Object[] elementData;
private static final int MAX_ARRAY_SIZE = Integer.MAX_VALUE - 8;
private int size;
private static final Object[] EMPTY_ELEMENTDATA = {};
public boolean add(Object e) {
int minCapacity = size+1;
if (elementData == DEFAULTCAPACITY_EMPTY_ELEMENTDATA) {
minCapacity = Math.max(DEFAULT_CAPACITY, minCapacity);
}
if(elementData.length>1){
System.out.println(elementData[1]);
}
modCount++;
if (minCapacity - elementData.length > 0){
int oldCapacity = elementData.length;
int newCapacity = oldCapacity + (oldCapacity >> 1);
if (newCapacity - minCapacity < 0){
newCapacity = minCapacity;
}
if (newCapacity - MAX_ARRAY_SIZE > 0){
if (minCapacity < 0){
// overflow
throw new OutOfMemoryError();
}
newCapacity = (minCapacity > MAX_ARRAY_SIZE) ?
Integer.MAX_VALUE :
MAX_ARRAY_SIZE;
}
// minCapacity is usually close to size, so this is a win:
elementData = Arrays.copyOf(elementData, newCapacity);
}
elementData[size++] = e;
return true;
}
public ArrayListDemo(int initialCapacity) {
if (initialCapacity > 0) {
this.elementData = new Object[initialCapacity];
} else if (initialCapacity == 0) {
this.elementData = EMPTY_ELEMENTDATA;
} else {
throw new IllegalArgumentException("Illegal Capacity: "+
initialCapacity);
}
}
/**
* Constructs an empty list with an initial capacity of ten.
*/
public ArrayListDemo() {
this.elementData = DEFAULTCAPACITY_EMPTY_ELEMENTDATA;
}
public int size() {
return size;
}
public static void main(String[] args) {
ArrayListDemo demo = new ArrayListDemo();
for(int i=0;i<17;i++){
boolean add = demo.add(i);
System.out.println("i="+i+",size="+demo.size()+",add="+add);
}
}
}
ArrayListDemo add 扩容
最新推荐文章于 2026-07-06 16:11:46 发布
1894

被折叠的 条评论
为什么被折叠?



