数组

1. 制作属于自己的动态数组
   class Array
   总容量:capacity
   实际容量:size(初始为0)
   实现 增 删 改 查

public class Array {
    private int[] data;//数据
    private int size;//实际大小

    /**
     * @param capacity
     */
    //构造函数,传入数组的capacity构造Array
    public Array(int capacity) {
        data = new int[capacity];
        size = 0;
    }

    /**
     * 无参数的构造函数,默认传入数组的capacity为10
     */
    public Array() {
        this(10);
    }

    /**
     * 获取数组中元素的个数
     *
     * @return
     */
    public int getSize() {
        return size;
    }

    /**
     * 获取数组的总容量
     *
     * @return
     */
    public int getCapacity() {
        return data.length;
    }

    /**
     * 返回数组是否为空
     *
     * @return
     */
    public boolean isEmpty() {

        return size == 0;
    }

    /**
     * 向数组添加元素,在数组的末尾添加元素
     */
    public void addLast(int e) {
        add(size, e);
    }

    /**
     * 向指定位置插入元素
     *
     * @param index
     * @param e
     */
    public void add(int index, int e) {
        if (size == data.length) {
            throw new IllegalArgumentException("AddLast failed. Array is full");
        }
        if (index < 0 || index > size) {
            throw new IllegalArgumentException("Add failed. Require index >= 0 and index <= size");
        }
        for (int i = size - 1; i >= index; i--) {
            data[i + 1] = data[i];
        }
        data[index] = e;
        size++;

    }

    /**
     * 取出index索引对应的元素
     *
     * @param index
     * @return
     */
    public int get(int index) {
        if (index < 0 || index >= size) {
            throw new IllegalArgumentException("Get failed");
        }
        return data[index];
    }

    /**
     * 修改元素
     *
     * @param index
     * @param e
     */
    public void set(int index, int e) {
        if (index < 0 || index >= size) {
            throw new IllegalArgumentException("Set failed");
        }
        data[index] = e;
    }

    /**
     * 查看数组中是否有元素e
     *
     * @param e
     * @return
     */
    public boolean contains(int e) {
        for (int i = 0; i < size; i++) {
            if (data[i] == e) {
                return true;
            }

        }
        return false;

    }

    /**
     * 查找数组中是否存在e
     * @param e
     * @return
     */
    public int find(int e) {
        for (int i = 0; i < size; i++) {
            if (data[i] == e) {
                return i;
            }

        }
        return -1;

    }

    /**
     * 从数组中删除元素
     *
     * @return
     */
    public void delete(int index) {
        if (index < 0 || index >= size)
            throw new IllegalArgumentException("Not allowed");
        for (int i = index + 1; i < size; i++) {

            data[i - 1] = data[i];
            size --;
        }

    }

    /**
     * 从数组中删除第一个元素
     */
    public void deleteFirst() {
        delete(0);
    }

    /**
     * 从数组中删除最后一个元素
     */
    public void deleteLast() {
        delete(size - 1);
    }

    /**
     * 从数组中删除元素e
     * @param e
     */
    public void deleteElement(int e) {
        int index = find(e);
        if (index != -1) {
            delete(index);
        }

    }


    @Override
    public String toString() {
        StringBuilder res = new StringBuilder();
        res.append(String.format("Array size = %d, capacity = %d\n", size, data.length));
        res.append('[');
        for (int i = 0; i < size; i++) {
            res.append(data[i]);
            if (i != size - 1) {
                res.append(", ");
            }

        }
        res.append(']');
        return res.toString();
    }
}

2. 测试用例:

package com.mfq.array;

public class Main {
    public static void main(String[] args) {
        Array array = new Array(20);
        for (int i = 0; i < 10; i++) {
            array.addLast(i);

        }
        array.add(1, 29);
        System.out.println(array);
        array.delete(3);
        System.out.println(array);
    }
}

输出:
Array size = 11, capacity = 20
[0, 29, 1, 2, 3, 4, 5, 6, 7, 8, 9]
Array size = 10, capacity = 20
[0, 29, 1, 3, 4, 5, 6, 7, 8, 9]