java代码如何实现简单的顺序表 java代码线性表基础结构的编写技巧​

public class SequenceList<T> {

    private T[] data; // 存储数据的数组
    private int size;  // 当前顺序表的元素个数
    private int capacity; // 顺序表的最大容量

    public SequenceList() {
        this(10); // 默认容量为10
    }

    public SequenceList(int initialCapacity) {
        this.capacity = initialCapacity;
        this.data = (T[]) new Object[initialCapacity]; // 注意类型转换
        this.size = 0;
    }

    // 添加元素到顺序表末尾
    public void add(T element) {
        ensureCapacity(size + 1); // 确保容量足够
        data[size++] = element;
    }

    // 在指定位置插入元素
    public void insert(int index, T element) {
        if (index < 0 || index > size) {
            throw new IndexOutOfBoundsException("Index: " + index + ", Size: " + size);
        }
        ensureCapacity(size + 1);
        for (int i = size; i > index; i--) {
            data[i] = data[i - 1]; // 元素后移
        }
        data[index] = element;
        size++;
    }

    // 删除指定位置的元素
    public T remove(int index) {
        if (index < 0 || index >= size) {
            throw new IndexOutOfBoundsException("Index: " + index + ", Size: " + size);
        }
        T removedElement = data[index];
        for (int i = index; i < size - 1; i++) {
            data[i] = data[i + 1]; // 元素前移
        }
        data[--size] = null; // help GC, 防止内存泄漏，重要！
        return removedElement;
    }

    // 获取指定位置的元素
    public T get(int index) {
        if (index < 0 || index >= size) {
            throw new IndexOutOfBoundsException("Index: " + index + ", Size: " + size);
        }
        return data[index];
    }

    // 设置指定位置的元素
    public void set(int index, T element) {
        if (index < 0 || index >= size) {
            throw new IndexOutOfBoundsException("Index: " + index + ", Size: "size);
        }
        data[index] = element;
    }

    // 获取顺序表的大小
    public int size() {
        return size;
    }

    // 顺序表是否为空
    public boolean isEmpty() {
        return size == 0;
    }

    // 确保容量足够
    private void ensureCapacity(int minCapacity) {
        if (minCapacity > capacity) {
            int newCapacity = Math.max(minCapacity, capacity * 2); // 扩容为原来的2倍
            T[] newData = (T[]) new Object[newCapacity];
            System.arraycopy(data, 0, newData, 0, size);
            data = newData;
            capacity = newCapacity;
        }
    }

    // toString 方法，方便查看顺序表的内容
    @Override
    public String toString() {
        StringBuilder sb = new StringBuilder();
        sb.append("[");
        for (int i = 0; i < size; i++) {
            sb.append(data[i]);
            if (i < size - 1) {
                sb.append(", ");
            }
        }
        sb.append("]");
        return sb.toString();
    }

    public static void main(String[] args) {
        SequenceList<String> list = new SequenceList<>();
        list.add("Apple");
        list.add("Banana");
        list.add("Orange");
        System.out.println(list); // 输出: [Apple, Banana, Orange]

        list.insert(1, "Grape");
        System.out.println(list); // 输出: [Apple, Grape, Banana, Orange]

        list.remove(2);
        System.out.println(list); // 输出: [Apple, Grape, Orange]

        System.out.println("Size: " + list.size()); // 输出: Size: 3
        System.out.println("Get element at index 1: " + list.get(1)); // 输出: Get element at index 1: Grape
    }
}