数据结构与算法（三）数组与链表编程实践

1.支持动态扩容的数组

public class DynamicArray {
        //扩容因子
        final float factor = 0.75f;
        int size = 16;
        int currentIndex = 0;
        int[] arrays = new int[size];


        private void put(int num) {
            
            if (currentIndex > size * factor) {
                //扩容并转移数据
                int newSize = size * 2;
                size = newSize;
                int[] newArray = new int[newSize];
                for (int i = 0; i < currentIndex; i++) {
                    newArray[i] = arrays[i];
                }
//            也可以用下面的方法来做数组拷贝
//            if (currentIndex >= 0)
//                System.arraycopy(arrays, 0, newArray, 0, currentIndex);
                arrays = newArray;
            }
            arrays[currentIndex] = num;
            currentIndex++;

//            for (int i = 0; i < currentIndex; i++) {
//                System.out.print("num=" + num + "  current=" + arrays[i] + "\n");
//            }
//            System.out.println("   ");
        }

        private int get(int index){
            return arrays[index];
        }
    }public class DynamicArray {