数组练习题

数组练习题

1.实现一个方法 avg, 以数组为参数, 求数组中所有元素的平均值(注意方法的返回值类型).

public static void main(String[] args) {
        int[] arr = null;
        int[] arr1 = {};
        int[] arr2 = new int[5];
        int[] arr3 = {1, 2, 3, 4, 5};
        int[] arr4 = {1, 4, 5, 7};
        System.out.println(avg(arr));
        System.out.println(avg(arr1));
        System.out.println(avg(arr2));
        System.out.println(avg(arr3));
        System.out.println(avg(arr4));
    }

    public static double avg(int[] arr) {
        double sum = 0;
        if (arr == null) {
            return sum;
        }
        for (int i = 0; i < arr.length; i++) {
            sum += arr[i];
        }
        return sum / (arr.length - 1);
    }

2.实现一个方法 sum, 以数组为参数, 求数组所有元素之和.

public class Test02 {
    public static void main(String[] args) {
        int[] arr = null;
        int[] arr1 = {};
        int[] arr2 = new int[5];
        int[] arr3 = {1, 2, 3, 4, 5};
        System.out.println(sum(arr));
        System.out.println(sum(arr1));
        System.out.println(sum(arr2));
        System.out.println(sum(arr3));
    }

    public static int sum(int[] arr) {
        if (arr == null) {
            return 0;
        }
        int sum = 0;
        for (int i = 0; i < arr.length; i++) {
            sum += arr[i];
        }
        return sum;
    }
}

3.实现一个方法 transform, 以数组为参数, 循环将数组中的每个元素 乘以 2 , 并设置到对应的数组元素上. 例如 原数组为 {1, 2, 3}, 修改之后为 {2, 4, 6}

public class Test03 {
    public static void main(String[] args) {
        int[] arr = {1, 2, 3};
        System.out.println("变换前："+ Arrays.toString(arr));
        System.out.println("变换后:"+Arrays.toString(transform(arr)));
    }
    public static int[] transform(int[] arr) {
        int[] ret = new int[arr.length];
        for (int i = 0; i < arr.length; i++) {
            ret[i] = arr[i] * 2;
        }
        return ret;
    }
}

4.实现一个方法 printArray, 以数组为参数, 循环访问数组中的每个元素, 打印每个元素的值.

public class Test04 {
    public static void main(String[] args) {
        int[] arr = {1, 2, 3, 4, 5};
        printArray(arr);
    }
    public static void printArray(int[] arr) {
        for (int i = 0; i < arr.length; i++) {
            System.out.print(arr[i]+" ");
        }
    }
}

5.创建一个 int 类型的数组, 元素个数为 100, 并把每个元素依次设置为 1 - 100

public class Test05 {
    public static void main(String[] args) {
        int[] array = new int[100];
        for (int i = 0; i < array.length; i++) {
            array[i] = i + 1;
        }
        System.out.println(Arrays.toString(array));
    }
}

6.给定一个整形数组，实现冒泡排序

public class Test06 {
    public static void main(String[] args) {
        int[] arr = {8, 4, 3, 6, 1};
        bubblySort(arr);
        System.out.println(Arrays.toString(arr));
    }

    public static void bubblySort(int[] arr) {
        boolean flag = false;
        for (int i = 0; i < arr.length - 1; i++) {
            flag = false;
            for (int j = 0; j < arr.length - i - 1; j++) {
                if (arr[j] > arr[j + 1]) {
                    int temp = arr[j];
                    arr[j] = arr[j + 1];
                    arr[j + 1] = temp;
                    flag = true;
                }
            }
            if (flag = false) {
                break;
            }
        }
    }
}

7.给定一个整形数组，判定数组是否有序

public class Test07 {
    public static void main(String[] args) {
        int[] arr = {1, 2, 3, 4, 5};
        int[] arr1 = {1, 3, 4, 2, 9};
        System.out.println(order(arr));
        System.out.println(order(arr1));
    }

    public static boolean order(int[] arr) {
        for (int i = 0; i < arr.length - 1; i++) {
            if (arr[i] > arr[i + 1]) {
                return false;
            }
        }
        return true;
    }
}

8.给定一个有序整型数组，实现二分查找

public class Test08 {
    public static void main(String[] args) {
        int[] arr = null;
        int[] arr1 = {1, 5, 2, 4, 7};
        int[] arr2 = {};
        System.out.println(binarySearch(arr, 0));
        System.out.println(binarySearch(arr1, 2));
        System.out.println(binarySearch(arr1, 10));
        System.out.println(binarySearch(arr2, 0));
    }
    public static int binarySearch(int[] arr,int toFind) {
        if (arr == null) {
            return -1;
        }
        int left = 0;
        int right = arr.length - 1;
        while (left <= right) {
            int mid = (left + right) / 2;
            if (arr[mid] < toFind) {
                left = mid + 1;
            } else if (arr[mid] > toFind) {
                right = mid - 1;
            } else {
                return mid;
            }
        }
        return -1;
    }
}

9.实现一个方法，对整型数组进行拷贝

public class Test09 {
    public static void main(String[] args) {
        int[] arr = {1, 2, 3, 4, 5};
        System.out.println("拷贝前："+Arrays.toString(arr));
        int[] copy = copyOf(arr);
        System.out.println("拷贝后："+Arrays.toString(copy));
    }

    public static int[] copyOf(int[] arr) {
        int[] ret = new int[arr.length];
        for (int i = 0; i < arr.length; i++) {
            ret[i] = arr[i];
        }
        return ret;
    }
}

10.实现一个方法 toString, 把一个整型数组转换成字符串. 例如数组 {1, 2, 3} , 返回的字符串为 “[1, 2, 3]”, 注意 逗号 的位置和数量.

public class Test10 {
    public static void main(String[] args) {
        int[] arr = {1, 2, 3, 4, 5};
        int[] arr1 = {};
        System.out.println(toString(arr));
        System.out.println(toString(arr1));
    }
    public static String toString(int[] arr) {
        String str = "[";
        if ( arr.length == 0) {
            return "[]";
        }
        if (arr == null) {
            return "";
        }
        for (int i = 0; i < arr.length; i++) {
            str = str + arr[i];
            if (i != arr.length-1) {
                str = str + ",";
            }
        }
        str = str + "]";
        return str;
    }
}