Array数组习题

习题一：数组反转

public class demo02 {
    public static void main(String[] args) {
        int[] arrays ={1,2,3,4,5};

        int[] reverse = reverse(arrays);
        test(reverse);
    }
    public static int[] reverse(int[] arrays){
        int[] result =new int[arrays.length];
        for (int i = 0,j=arrays.length-1;i <arrays.length ; i++,j--) {
            result[j]=arrays[i];
        }
        return result;
    }
    public static void test(int[] arrays){
        for (int i = 0; i <arrays.length ; i++) {
            System.out.print(arrays[i]+"\t");
        }
    }
}

习题二：打印二维数组的值

public class demo03 {
    //打印二维数组的值
    public static void main(String[] args) {
        int[][] arr ={{1,2},{3,4},{5,6},{7,8}};
        for (int i = 0; i < arr.length; i++) {
            for (int j = 0; j < arr[i].length; j++) {
                System.out.println(arr[i][j]);
            }
        }
        System.out.println(arr.length);  //打印二维数组的长度
    }
}

习题三：冒泡排序

public class demo05 {
    public static void main(String[] args) {
        int[] a={8,1,35,47,19,-2};
        int[] sort = sort(a);
        System.out.println(Arrays.toString(sort)); //[-2, 1, 8, 19, 35, 47]
    }
    public static int[] sort(int[] array){
        int temp=0;
        //外层循环，判断要走多少次， 次数length-1
        for (int i = 0; i < array.length-1; i++) {
            //内层循环：如果第一个数大于第二个数，交换它们位置
            for (int j = 0; j < array.length-1-i; j++) {
                if(array[j]>array[j+1]){
                    temp=array[j];
                    array[j]=array[j+1];
                    array[j+1]=temp;
                }
            }
        }
        return array;
    }
}

习题三：稀疏数组的转化与还原

public class demo06 {
    public static void main(String[] args) {
        //创建一个二维数组 11*11  
        int[][] array1 = new int[11][11];
        array1[1][2] = 1;
        array1[2][3] = 2;
//输出原始的数组
        System.out.println("原始的数组：");
        for (int[] array : array1) {
            for (int i : array) {
                System.out.print(i + "\t");
            }
            System.out.println();
        }

//转换为稀疏数组保存
//1.有效值的个数
        int sum = 0; //有效值总数
        for (int i = 0; i < 11; i++) {
            for (int j = 0; j < 11; j++) {
                if (array1[i][j] != 0) {
                    sum++;
                }
            }
        }
//2.创建一个稀疏数组
        int[][] array2 = new int[sum + 1][3];
        array2[0][0] = 11;
        array2[0][1] = 11;
        array2[0][2] = sum;

//3.遍历二维数组，将有效值存放到稀疏数组
        int count = 0;
        for (int i = 0; i < array1.length; i++) {
            for (int j = 0; j < array1[i].length; j++) {
                if (array1[i][j] != 0) {
                    count++;
                    array2[count][0] = i;
                    array2[count][1] = j;
                    array2[count][2] = array1[i][j];
                }
            }
        }

//4.输出稀疏数组
        System.out.println("稀疏数组：");
        for (int i = 0; i < array2.length; i++) {
            for (int j = 0; j < array2[i].length; j++) {
                System.out.print(array2[i][j] + "\t");
            }
            System.out.println();
        }

//还原数组
        System.out.println("还原数组");
//1、读取稀疏数组
        int[][] array3 = new int[array2[0][0]][array2[0][1]];
//2、还原元素的值
        for (int i = 1; i < array2.length; i++) {
            array3[array2[i][0]][array2[i][1]] = array2[i][2];
        }
//3、打印数组
        for (int[] arr1:array3){
            for (int arr2:arr1){
                System.out.print(arr2+"\t");
            }
            System.out.println();
        }
    }
}