java实现线性表

java实现顺序表SequenceList

package wh1006.datastructure.train;

import java.util.Iterator;

public class SequenceList<T> implements Iterable{
    private T[] eles;
    private int N;
    public SequenceList(int capacity){
        this.eles = (T[]) new Object[capacity];
        this.N = 0;
    }
    //初始化顺序表
    public void clear(){
        this.N =0;
    }
    //判断线性表是否为空
    public boolean isEmpty(){
        return N==0;
    }
    //返回线性表的长度
    public int length(){
        return N;
    }
    //返回第i个位置的元素
    public T get(int i){
        return eles[i];
    }
    //数组扩容
    public void resize(int newSize){
        T[] temp = eles;
        eles = (T[]) new Object[newSize];
        for (int i = 0; i < eles.length; i++) {
            eles[i] = temp[i];
        }
    }
    //插入元素
    public void insert(T t){
        //判断线性表满不满
        if(N==eles.length){
            resize(N*2);
        }
        eles[N] = t;
        N++;
    }
    //插入元素到指定位置
    public void insert(int i,T t){
        if(N==eles.length){
            resize(N*2);
        }
        N++;
        for (int j = N-1; j >= i ; j--) {
            eles[j+1] = eles[j];
        }
    }
    //删除元素(根据下标删除）
    public T remove(int i){
        T t = eles[i];
        for (int j = i; j <eles.length-1; j++) {
            eles[j] = eles[j+1];
        }
        N--;
        return t;
    }

    //删除第一次出现元素(根据元素删除）
    public void remove(T t){
        int j = 0;
        for (int i = 0; i < eles.length; i++) {
            if(eles[i] == t){
                 j = i;
            }
        }
        for (int z = j;z<eles.length-1;z++){
            eles[z] = eles[z+1];
        }
        N--;
    }
    //遍历
    @Override
    public Iterator iterator() {
        return new SItrator();
    }
    private class SItrator implements Iterator{
        private int cursor = 0;
        @Override
        public boolean hasNext() {
            return N==cursor;
        }

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