JAVA算法与数据结构，顺序表

顺序表

public class SequenceList<T> implements Iterable<T>{
    //存储元素的数组
    private T[] eles;
    //记录当前顺序表中的元素个数
    private int N;

    //构造方法
    public SequenceList(int capacity){
        eles = (T[]) new Object[capacity];
        N = 0;
    }

    //将一个线性表置为空表
    public void clear(){
        N = 0;
    }

    //判断当前线性表是否为空表
    public boolean isEmpty(){
        return N == 0;
    }

    //获取线性表的长度
    public int length(){
        return N;
    }

    //获取指定位置的元素
    public T get(int i){
        if (i < 0 || i >= N){
            throw new RuntimeException("当前元素不存在");
        }

        return eles[i];
    }

    //向线性表中添加元素t
    public void insert(T t){
        if (N == eles.length){
            throw new RuntimeException("线性表已满，添加失败");
        }

        eles[N] = t;
        N++;
    }

    //在i元素处插入元素t
    public void insert(int i,T t){
        if (N == eles.length){
            throw new RuntimeException("线性表已满，添加失败");
        }

        if (i < 0 || i > N){
            throw new RuntimeException("添加元素的位置不合法");
        }

        for (int j = N; j > i ; j--) {
            eles[j] = eles[j - 1];
        }

        eles[i] = t;
        N++;
    }

    //删除指定位置i处的元素，并返回该元素
    public T remove(int i){
        if (N == 0){
            throw new RuntimeException("线性表为空，删除失败");
        }

        if (i < 0 || i >= N){
            throw new RuntimeException("删除元素的位置不合法");
        }

        T result = eles[i];

        for (int j = i + 1; j < N; j++) {
            eles[j - 1] = eles[j];
        }

        N--;
        return result;
    }

    //查找t元素第一次出现的位置
    public int indexOf(T t){
        if (N == 0){
            throw new RuntimeException("线性表为空");
        }

        for (int i = 0; i < N; i++) {
            if (eles[i].equals(t)){
                return i;
            }
        }

        return -1;
    }

    //遍历元素
    public void showEles(){
        for (int i = 0; i < N; i++) {
            System.out.println(eles[i]);
        }
    }



    @Override
    public Iterator<T> iterator() {
        return new SIterator();
    }

    private class SIterator implements Iterator{
        private int cur;

        public SIterator(){
            this.cur = 0;
        }
        @Override
        public boolean hasNext() {
            return cur < N;
        }

        @Override
        public Object next() {
            return eles[cur++];
        }
    }

    //测试代码
    public static void main(String[] args) {
        SequenceList<String> s = new SequenceList<>(10);

        //测试插入
        s.insert("孙悟空");
        s.insert("唐僧");
        s.insert("猪八戒");

        //遍历元素
        //s.showEles();
        for (String s1 : s) {
            System.out.println(s1);
        }

        //测试获取
        System.out.println(s.get(1));


        //测试删除
        System.out.println(s.remove(2));

        //测试清空
        s.clear();
        System.out.println(s.length());
    }
}