[ Web Proxy ]
URL:
Viewing: https://raw.githubusercontent.com/open-source-backup/algo/master/java/05_array/GenericArray.java [Back]  [Original]

public class GenericArray {
    private T[] data;
    private int size;

    // Array
    public GenericArray(int capacity) {
        data = (T[]) new Object[capacity];
        size = 0;
    }

    // 10
    public GenericArray() {
        this(10);
    }

    // 
    public int getCapacity() {
        return data.length;
    }

    // 
    public int count() {
        return size;
    }

    // 
    public boolean isEmpty() {
        return size == 0;
    }

    //  index 
    public void set(int index, T e) {
        checkIndex(index);
        data[index] = e;
    }

    //  index 
    public T get(int index) {
        checkIndex(index);
        return data[index];
    }

    // e
    public boolean contains(T e) {
        for (int i = 0; i < size; i++) {
            if (data[i].equals(e)) {
                return true;
            }
        }
        return false;
    }

    // ,  -1
    public int find(T e) {
        for ( int i = 0; i < size; i++) {
            if (data[i].equals(e)) {
                return i;
            }
        }
        return -1;
    }


    //  index e,  O(m+n)
    public void add(int index, T e) {
        checkIndex(index);
        // 2
        if (size == data.length) {
            resize(2 * data.length);
        }

        for (int i = size - 1; i >= index; i--) {
            data[i + 1] = data[i];
        }
        data[index] = e;
        size++;
    }

    // 
    public void addFirst(T e) {
        add(0, e);
    }

    // 
    public void addLast(T e) {
        add(size, e);
    }

    //  index 
    public T remove(int index) {
        checkIndexForRemove(index);

        T ret = data[index];
        for (int i = index + 1; i < size; i++) {
            data[i - 1] = data[i];
        }
        size --;
        data[size] = null;

        // 
        if (size == data.length / 4 && data.length / 2 != 0) {
            resize(data.length / 2);
        }

        return ret;
    }

    // 
    public T removeFirst() {
        return remove(0);
    }

    // 
    public T removeLast() {
        return remove(size - 1);
    }

    // 
    public void removeElement(T e) {
        int index = find(e);
        if (index != -1) {
            remove(index);
        }
    }

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


    //  O(n)
    private void resize(int capacity) {
        T[] newData = (T[]) new Object[capacity];

        for (int i = 0; i < size; i++) {
            newData[i] = data[i];
        }
        data = newData;
    }

    private void checkIndex(int index) {
        if (index < 0 || index > size) {
            throw new IllegalArgumentException("Add failed! Require index >=0 and index =0 and index < size.");
        }
    }
}

Web Proxy Viewer  |  New URL  |  Original Page