java中顺序表的各种操作

package www.bit.java;

public interface ISequence {
    //在pos位置插入val
    boolean add(int pos,Object data);
    //查找关键字key 找到返回key的下标，没有返回-1;
    int search(Object key);
    //查找是否包含关键字key是否在顺序表当中(这个和search有点冲突)
    boolean contains(Object key);
    //得到pos位置的值
    Object getPos(int pos);
    //删除第一次出现的关键字key
    Object remove(Object key);
    //得到顺序表的长度
    int size();
    //打印顺序表
    void display();
    //清空顺序表以防内存泄漏
    void clear();
}

package www.bit.java;
/*顺序表的实现*/
import java.util.Arrays;
/*getter、setter
* 构造方法
* */
public class MySequnence implements ISequence {
    private Object[] elem;
    private int usedSize;
    private static final int DEFAULT_SIZE = 10;
    public MySequnence(){
        this.elem = new Object[DEFAULT_SIZE];
        this.usedSize = 0;
    }
    private boolean isFull(){
        /*if(this.usedSize == elem.length){
            return true;
        }
        return false;*/
        return this.usedSize == this.elem.length;
    }
    @Override
    public boolean add(int index, Object data) {
        if(isFull()){
            //实现2倍扩容
            this.elem = Arrays.copyOf(this.elem,2*this.elem.length);
        }
        if(index<0||index>usedSize){
            return false;
        }
        for(int i=this.usedSize-1;i>=index;i--){
            this.elem[i+1]=this.elem[i];
        }
        this.elem[index] = data;
        this.usedSize++;
        return true;
    }
        //1 pos位置的合法性进行判断
        //2 判断是否为满
    // }

    @Override
    public boolean contains(Object key) {
        if(isEmpty()){
            return false;
        }
        for(int i = 0;i<usedSize-1;i++){
            if(this.elem[i].equals(key)){
                return true;
            }
        }
        return false;
    }

    private boolean isEmpty(){
        /*if(this.usedSize==0){
            return true;
        }
        return false;*/
        return this.usedSize == 0;
    }
    @Override
    public int search(Object key) {
        if(isEmpty()){
            return -1;
        }
        for(int i = 0;i<usedSize;i++){
            if(this.elem[i].equals(key)){
                return i;
            }
        }
        return -1;
    }

    @Override
    public int size() {
        return usedSize;
    }

    @Override
    public Object getPos(int pos) {
        if(isEmpty()){
            return null;
        }
        if(pos<0||pos>usedSize-1){
            return null;
        }
        return this.elem[pos];
    }

    @Override
    public Object remove(Object key) {
        int index = search(key);
        if (index == -1){
            return null;
        }
        Object data = this.elem[index];
        int i;
        for(i = index;i<usedSize-1;i++){
            this.elem[i] = this.elem[i+1];
        }
        this.usedSize--;
        this.elem[i] = null;
        return data;
    }
    @Override
    public void display() {
        for(int i = 0;i<usedSize;i++){
            System.out.print(this.elem[i]+"、");
        }
        System.out.println();
    }
    @Override
    public void clear() {
        for(int i = 0;i<usedSize;i++){
            this.elem[i] = null;
        }
    }
}

package www.bit.java;

class Person{}
public class TestDemo1 {
        public static void main(String[] args) throws InterruptedException {
            MySequnence mySequnence = new MySequnence();
            /*for(int i = 0;i<20;i++){
                mySequnence.add(i,i);
            }*/
            mySequnence.add(0,new Person());
            mySequnence.add(1,new Person());
            mySequnence.add(2,new Person());
            mySequnence.display();
            //Object res = mySequnence.remove(6);
            //System.out.println(res);
            //mySequnence.add(13,"陈");
            //java里面如何测试内存泄漏
            mySequnence.clear();
            Thread.sleep(1000);
        /*mySequnence.add(0,10);
        mySequnence.add(1,20);
        mySequnence.add(2,30);
        mySequnence.add(3,40);
        mySequnence.add(4,50);*/

        }
    }