![](https://cos-cdn.shuashuati.com/pipixue-web/2020-1231-2005-12/ti_inject-812ce.png)
看代码,写出执行结果,由于是填空题,所以一定要严格写出结果,不要出现多余的空格等符号 package test0; public class MyArrayList2 { Object[] elementData; private int size; public MyArrayList2() { this.size = 0; elementData = new Object[10]; } public MyArrayList2(int length) { this.size = 0; elementData = new Object[length]; } public void add(Object obj) { if (this.size == elementData.length) { // 扩容 grow(); } elementData[size] = obj; size++; } private void grow() { Object[] tmpArray = new Object[(int) (elementData.length * 1.5)]; for (int i = 0; i < elementData.length; i++) { tmpArray[i] = elementData[i]; } elementData = tmpArray; } public Object get(int index) { rangeCheck(index); return elementData[index]; } private void rangeCheck(int index) { if (index >= size) throw new IndexOutOfBoundsException(outOfBoundsMsg(index)); } private String outOfBoundsMsg(int index) { return "Index: " + index + ", Size: " + size; } public int size() { return this.size; } public void clear() { this.size = 0; } public void set(int index, Object element) { rangeCheck(index); elementData[index] = element; } public int indexOf(Object o) { if (o == null) { for (int i = 0; i < size; i++) if (elementData[i] == null) return i; } else { for (int i = 0; i < size; i++) if (o.equals(elementData[i])) return i; } return -1; } public boolean contains(Object o) { return indexOf(o) >= 0; } public Object remove(int index) { rangeCheck(index); Object oldValue = elementData[index]; for (int i = index + 1; i < this.size; i++) { this.elementData[i - 1] = elementData[i]; } this.size--; return oldValue; } public boolean remove(Object o) { int index = indexOf(o); if (index == -1) return false; remove(index); return true; } } package test0; public class Main3 { public static void main(String[] args) { MyArrayList2 list = new MyArrayList2(); for(int i =1;i<=10;i++) { list.add(i); } list.remove(1); list.remove(new Integer(3)); for(int i =0;i