java数组 #学习日记8

数组

public class Demo {
    public static void main(String[] args) {
        int[] nums;//1.声明一个数组   int nums[];效果相同，不是首选
        nums = new int[5];//2.创建一个数组
        //int[] nums = new int[5];(步骤1+2)
        //3.给元素赋值
        nums[0] = 1;
        nums[1] = 2;
        nums[2] = 3;
        nums[3] = 4;
        nums[4] = 5;
        System.out.println(nums[0]);
        //计算数组的和
        //获取数组长度 array.length
        int sum = 0;
        for (int i = 0; i < nums.length; i++) {
            sum = sum + nums[i];//sum += i
        }
        System.out.println(sum);
    }
}

public class Demo1 {
    public static void main(String[] args) {
        //静态初始化：创建+赋值
        int[] i = {1,2,3,4,5};
        System.out.println(i[0]);
        //动态初始化:包含默认初始化
        int [] a = new int[5];
        a[0] = 10;
        System.out.println(a[0]);
        /*
        数组是相同数据类型（数组类型可以是任意类型）的有序集合
        数组也是对象。数组元素相当于对象的成员变量
        数组长度是确定的，不可变的。如果越界，则报：ArrayIndexOutofBounds
        下标合法期间，[0,length-1]
         */
    }
}

public class Demo2 {
    public static void main(String[] args) {
        //打印数组的元素
        int[] arrays= {1,2,3,4,5};
        for (int i = 0; i < arrays.length; i++) {
            System.out.println(arrays[i]);
        }
        //查找最大元素
        int max = arrays[0];
        for (int i1 = 1; i1 < arrays.length; i1++) {
            if (max < arrays[i1]){
                max = arrays[i1];
            }
        }
        System.out.println(max);
    }
}

public class Demo3 {
    public static void main(String[] args) {
        int[] arrays = {1, 2, 3, 4, 5};
        //For-Each循环，没有下标,适合打印输出（jdk1.5）
        for (int array : arrays) {
            System.out.println(array);
        }
        int[] reverse= reverse(arrays);
        printArray(reverse);
    }

    //数组作为方法入参（参数）
    //打印数组元素
    public static void printArray(int[] arrays) {
        for (int i = 0; i < arrays.length; i++) {
            System.out.print(arrays[i]);
        }
    }

    //数组作为返回值
    //反转数组
    public static int[] reverse(int[] i) {
        int[] result = new int[i.length];
        for (int i1 = 0, j = result.length - 1; i1 < i.length; i1++, j--) {
            result[j] = i[i1];
        }
        return result;
    }
}

二维数组

public class Demo4 {
    public static void main(String[] args) {
        //多维数组
        int [][] array = {{1,2},{2,3},{3,4},{4,5}};
        //int array[][] = new int[4][2];
        for (int i = 0; i < array.length; i++) {
            for (int j = 0; j < array[i].length; j++) {
                System.out.println(array[i][j]);
            }
        }
    }
}

arrays类方法

public class Demo5 {
    public static void main(String[] args) {
        int[] i = {1,2,3,5,4};
        //arrays类方法
        //打印数组元素
        System.out.println(Arrays.toString(i));
        //数组排序，升序
        Arrays.sort(i);
        System.out.println(Arrays.toString(i));
        //数组填充
        Arrays.fill(i,2,3,0);
        System.out.println(Arrays.toString(i));
    }
}

冒泡排序

public class Demo6 {
    /*冒泡排序
   1.比较数组两个相邻的元素，如果第一个比第二个大，调换他两的位置
   2.每次比较都会产生最大或最小的数字
   3.下一轮可以减少一次排序
   4.依次循环，直到结束
      */
    public static void main(String[] args) {
        int [] a ={1,5,8,6,7,3};
        int [] sort = sort(a);
        System.out.println(Arrays.toString(sort));
    }

    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 Demo7 {
    public static void main(String[] args) {
        int arrays[][] = new int [11][11];
        arrays [1][2] = 1;
        arrays [2][3] = 2;
        System.out.println("输出原始数组");
        for (int[] ints : arrays) {
            for (int anInt : ints) {
                System.out.print(anInt+"\t");
            }
            System.out.println();
        }
        System.out.println("======================");
        //转换为稀疏数组
        //获取有效值个数
        int sum = 0;
        for (int i = 0; i < 11; i++) {
            for (int j = 0; j < 11; j++) {
                if (arrays[i][j]!=0){
                    sum++;
                }
            }
        }
        System.out.println("有效数组为"+sum);
        //创建稀疏数组
        int arrays2[][] = new int[sum+1][3];
        arrays2[0][0] = 11;
        arrays2[0][1] = 11;
        arrays2[0][2] = sum;
        //遍历二维数组，将非零的值存放在稀疏数组中
        int count = 0;
        for (int i = 0; i < arrays.length; i++) {
            for (int j = 0; j < arrays[i].length; j++) {
                if (arrays[i][j]!=0){
                count++;
                arrays2[count][0] = i;
                arrays2[count][1] = j;
                arrays2[count][2] = arrays[i][j];
                }
             }
        }
        //输出稀疏数组
        System.out.println("稀疏数组");
        for (int i = 0; i < arrays2.length; i++) {
            System.out.println(arrays2[i][0]+"\t"+
                    arrays2[i][1]+"\t"+
                    arrays2[i][2]+"\t");
            }
        System.out.println("===================");
        System.out.println("还原");
        //读取稀疏数组
        int [][] arrays3 = new int[arrays2[0][0]][arrays2[0][1]];
        //还原他的值
        for (int i = 1; i < arrays2.length; i++) {
            arrays3[arrays2[i][0]][arrays2[i][1]] = arrays2[i][2];
        }
        //打印
        System.out.println("输出原始数组");
        for (int[] ints : arrays3) {
            for (int anInt : ints) {
                System.out.print(anInt+"\t");
            }
            System.out.println();
        }
        }
    }