java数据结构和算法------线性表(顺序表结构)

package iYou.neugle.list;

public class MySeqList<T> {
    private int initMaxSize = 10;
    private T[] list;
    private int listLen = 0;

    public MySeqList() {
        this.Init();
    }

    public MySeqList(int size) {
        this.initMaxSize = size;
        this.Init();
    }

    public void Init() {
        this.list = (T[]) new Object[this.initMaxSize];
    }

    // 顺序表添加操作
    public boolean Add(T data) {
        if (this.listLen < this.initMaxSize) {
            this.list[listLen] = data;
            this.listLen++;
            System.out.println("插入成功");
            return true;
        }
        System.out.println("顺序表数据已满");
        return false;
    }

    // 顺序表插入操作
    public boolean Insert(int p, T data) {
        if (p < 0 || p > this.initMaxSize - 1) {
            System.out.println("插入数据位置非法");
            return false;
        }
        if (this.listLen == this.initMaxSize) {
            System.out.println("顺序表数据已满");
            return false;
        }
        // 容错处理
        if (p > this.listLen) {
            p = this.listLen;
            this.list[p] = data;
        } else {
            for (int i = this.listLen - 1; i >= p; i--) {
                this.list[i + 1] = this.list[i];
            }
            this.list[p] = data;
        }
        this.listLen++;
        System.out.println("插入成功");
        return true;
    }

    // 顺序表删除操作
    public boolean Delete(int p) {
        if (p < 0 || p > this.initMaxSize - 1) {
            System.out.println("删除数据位置非法");
            return false;
        }
        for (int i = p; i <= this.listLen - 1; i++) {
            this.list[i] = this.list[i + 1];
        }
        this.listLen--;
        System.out.println("删除成功");
        return true;
    }

    // 顺序表按下标查找
    public T Get(int p) {
        if (p < 0 || p > this.initMaxSize - 1) {
            System.out.println("查找数据不存在");
            return null;
        }

        System.out.println("查找成功，数据为:" + this.list[p]);
        return this.list[p];
    }

    // 顺序表大小
    public int SizeOf() {
        return this.listLen;
    }

    public void Print() {
        System.out.print("[");
        for (int i = 0; i < this.list.length; i++) {
            System.out.print(this.list[i]);
            if (i < this.list.length - 1) {
                System.out.print(",");
            }
        }
        System.out.println("]");
    }
}