Java数组知识

//数组基础
public class Demo01 {
    public static void main(String[] args) {
        //创建并声明数字
        int[] nums = new int[10];

        //给数组元素赋值
        nums[0] = 1;
        nums[1] = 2;
        nums[2] = 3;
        nums[3] = 4;
        nums[4] = 5;
        nums[5] = 6;
        nums[6] = 7;
        nums[7] = 8;
        nums[8] = 9;
        nums[9] = 10;

        //计算数组所有的和
        int sum = 0;

        //获取数组长度：array.length
        for (int i = 0; i < nums.length; i++) {
            sum += nums[i];
        }

        System.out.println(sum);
    }
}

//数组初始化
public class Demo02 {
    public static void main(String[] args) {
        //静态初始化：创建 + 赋值
        int[] a = {1,2,3,4,5,6};

        //动态初始化:包含默认初始化(缺省为0)
        int[] b = new int[10];
        b[0] = 10;

        System.out.println(a[0]);
        System.out.println(b[0]);
        System.out.println(b[1]);
    }
}

//增强for循环:极其适用于打印输出
public class Demo03 {
    public static void main(String[] args) {

        int[] a = {1,2,3,4,5};

        for (int i : a) {
            System.out.println(i);
        }
    }
}

//实现反转数组并打印
public class Demo04 {
    public static void main(String[] args) {
        int[] arr = {1,2,3,4,5};
        int[] rev = reverse(arr);
        printArray(rev);
    }


    //打印数组元素
    public static void printArray(int[] array){
        for (int i = 0; i < array.length; i++) {
            System.out.print(array[i] + " ");
        }
    }

    //反转数组
    public static int[] reverse(int[] array){
        int[] result = new int[array.length];

        for (int i = 0, j = array.length-1; i < array.length; i++, j--) {
            result[j] = array[i];
        }

        return result;
    }
}

//二维数组
public class Demo05 {
    public static void main(String[] args) {
        int[][] array = {{1,2},{2,3},{3,4}};

        System.out.println(array[0]); //输出HashCode
        System.out.println(array[0][0]);

        System.out.println("==================");

        for (int i = 0; i < array.length; i++) {
            for (int j = 0; j < array[i].length; j++) {
                System.out.println(array[i][j]);
            }

        }
    }
}

//Arrays类
import java.util.Arrays;

public class Demo06 {
    public static void main(String[] args) {
        int[] arr = {1,2,3,53,663,22,7};

        //打印数组元素
        System.out.println(Arrays.toString(arr));

        //数组排序：升序
        Arrays.sort(arr);

        System.out.println(Arrays.toString(arr));

        //数组填充
        Arrays.fill(arr,5);

        System.out.println(Arrays.toString(arr));

        Arrays.fill(arr,2,3,6);

        System.out.println(Arrays.toString(arr));
    }
}

import java.util.Arrays;

//冒泡排序
public class Demo07 {
    public static void main(String[] args) {
        int[] arr = {1, 53 , 42, 974, 33, 2};

        System.out.println(Arrays.toString(arr));

        sort(arr);

        System.out.println(Arrays.toString(arr));
    }

    public static int[] sort(int[] array){
        int temp = 0;

        for (int i = 0; i < array.length - 1; i++) {
            for (int j = 0; j < array.length - 1 - i; j++) {
                if (array[j+1] < array[j]){
                    temp = array[j];
                    array[j] = array[j + 1];
                    array[j + 1] = temp;
                }
            }
        }
        return array;
    }
}

//稀疏数组
public class Demo08 {
    public static void main(String[] args) {
        //1.创建一个二维数组
        int[][] array1 = new int[11][11];
        array1[1][2] = 1;
        array1[2][3] = 2;

        //输出原始数组
        System.out.println("输出原始数组");
        for (int[] ints : array1) {
            for (int anInt : ints) {
                System.out.print(anInt + "\t");
            }
            System.out.println();
        }

        //转换为稀疏数组保存
        //获取有效值的个数
        int sum = 0;
        for (int i = 0; i < array1.length; i++) {
            for (int j = 0; j < array1[i].length; j++) {
                if (array1[i][j] != 0){
                    sum++;
                }
            }
        }
        System.out.println("有效值的个数：" + sum);
        System.out.println("=========================================");

        //2.创建一个稀疏数组的数组
        int[][] array2 = new int[sum + 1][3];

        array2[0][0] = 11;
        array2[0][1] = 11;
        array2[0][2] = sum;

        //遍历二维数组，将非零的值，存放在稀疏数组中
        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];
                }
            }
        }

        //输出稀疏数组
        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("=========================================");
        System.out.println("还原");

        //1.读取稀疏数组
        int[][] array3 = new int[array2[0][0]][array2[0][1]];

        //2.给其中的元素还原它的值
        for (int i = 1; i < count + 1; i++) {
            array3[array2[i][0]][array2[i][1]] = array2[i][2];
        }

        //打印
        for (int i = 0; i < array3.length; i++) {
            for (int j = 0; j < array3[i].length; j++) {
                System.out.print(array3[i][j] + "\t");
                }
            System.out.println();
            }
        }
    }