java入门案例：模拟封装ArrayList集合

方法类：

package SET.SetConcept;

public class ArrayBox<E> {
    private static final int DEFAULT_CAPACITY = 10;
    private Object[] oldArray;
    private int size = 0;

    public ArrayBox() {
        oldArray = new Object[DEFAULT_CAPACITY];
    }

    public ArrayBox(int capacity) {
        oldArray = new Object[capacity];
    }

    //范围检测 是否合法
    private void rangeCheck(int index) {
        //如果index索引越界不合法
        if (index < 0 || index > size) {
            throw new ArrayIndexOutBoundsException("index：" + index + "size：" + size);
        }
    }

    //方法：判断空间是否够用
    private void minPrice(int mC) {//mP:空间最小值
        //如果需要的空间比原数组的唱的还大
        if (mC - oldArray.length > 0) {
            this.grow(mC);
        }
    }

    //方法：扩大容量
    private void grow(int mC) {
        //获取旧数组的长度
        int oldCapacity = oldArray.length;