顺序表的插入

import java.util.Arrays;

class MyArraylist {
//属性
private int[] elem;
private int usedSize;
private final int CAPACITY = 10;
//构造函数
public MyArraylist() {
this.elem = new int[CAPACITY];
this.usedSize = 0;
}
//判断顺序表是否已经被占满
private boolean isFull() {
if (this.usedSize == this.elem.length) {
return true;
}
return false;
}

public void add(int pos, int data) {
    if (isFull()) {
        //如果满进行扩容
        this.elem = Arrays.copyOf(this.elem,
                this.elem.length * 2);
    }
    //移动元素
    for (int i = this.usedSize - 1; i >= pos; i--) {
        this.elem[i + 1] = this.elem[i];

    }
    //插入元素
    this.elem[pos] = data;
    this.usedSize++;
}

public void display() {
    for (int i = 0; i < this.usedSize; i++) {
        System.out.print(this.elem[i]+" ");
    }
    System.out.println();
}

}
public class TestDemo1 {
public static void main(String[] args) {
MyArraylist myArraylist=new MyArraylist();
for (int i = 0; i <10 ; i++) {
myArraylist.add(i,i);
}
myArraylist.display();

}

}