//二維數(shù)組 兩行五列
    int a[][] = new int[2][5];

package com.sxl.array;
public class Demo04 {
    public static void main(String[] args) {
        //二維數(shù)組
        int[][] array = {{1,2},{3,4},{5,6}};
        for (int i = 0; i < array.length; i++) {
            for(int j = 0; j < array[i].length; j++){
                System.out.println(array[i][j]);
            }
        }
    }
}

package com.sxl.array;
import java.util.Arrays;
public class Demo01 {
    public static void main(String[] args) {
        //靜態(tài)初始化：創(chuàng)建 賦值
        int[] array = {1,2,3,4,5};
        //動態(tài)初始化 :包含默認初始化
        int[] b = new int[10];
        b[0] = 10;
        //printArray(array);
       // printString(array);
        System.out.println("==============");
        int[] result = reverse(array);
        printArray(result);
    }
    public static int[] reverse(int[] array){
        int[] result = new int[array.length];
        for (int i = 0,j = result.length-1; i < array.length ; i++,j--) {
            result[j] = array[i];
        }//加入Java開發(fā)交流君樣：593142328一起吹水聊天
        return result;
    }
    public static void printArray(int[] array){
        for (int i = 0; i < array.length; i++) {
            System.out.print(array[i] + " ");
        }
        System.out.println();
        System.out.println("=================");
        //增強循環(huán)
        for (int arr: array) {
            System.out.print(arr+ " ");
        }
        System.out.println();
        System.out.println("=================");
        String result = Arrays.toString(array);
        System.out.println(result);
    }
    public static void printString(int[] array){
        String result = Arrays.toString(array);
        System.out.println(result);
        for (int i = 0; i < array.length; i++) {
            if (i == 0){
                System.out.print("[" +array[i] +", ");
            }else if (i == array.length - 1){
                System.out.print(array[i]+"]");
            }else
            System.out.print(array[i]+", ");
        }
    }
}
package com.sxl.array;
public class Demo02 {
    public static void main(String[] args) {
        new Demo02();
        int[] array = {1,2,5,3,9,7,6,3,2};
        sort(array);
    }
    //冒泡排序
    public static void sort(int[] array){
        int temp = 0;
        for (int i = 0; i < array.length; i++) {
            boolean flag = false;
            for (int j = 0; j < array.length-1; j++){
                if (array[j+1]<array[j]){
                    temp = array[j];
                    array[j] = array[j+1];
                    array[j+1] = temp;
                    flag = true;
                }
            }
            if (flag == false){
                break;
            }
        }
        for (int i = 0; i < array.length; i++) {
            System.out.print(array[i]+" ");
        }
    }
}
package com.sxl.array;
public class Demo03 {//加入Java開發(fā)交流君樣：593142328一起吹水聊天
    public static void main(String[] args) {
        int[] array = {1,2,3,4,5};
        //打印所有數(shù)據(jù)元素
        for (int i = 0; i < array.length; i++) {
            System.out.print(array[i] + " ");
        }
        //計算所有數(shù)據(jù)元素的和
        System.out.println("=========");
        int sum = 0;
        for (int i = 0; i < array.length; i++) {
            sum += array[i];
        }
        System.out.println(sum);
        //查找最大元素
        int max = array[0];
        for (int i = 1; i < array.length; i++) {
            if (max < array[i]){
                max = array[i];
            }
        }
        System.out.println(max);
    }
}

package com.sxl.array;
public class Demo05 {
    public static void main(String[] args) {
        int[][] array = new int[11][11];
        array[1][2] = 1;
        array[2][3] = 2;
        //輸出原始數(shù)組
        for (int[] a: array) {
            for (int b: a) {
                System.out.print(b+"\t");
            }
            System.out.println();
        }
        //獲取有效值的個數(shù)
        int sum = 0;
        for (int i = 0; i < 11; i++) {
            for (int j = 0; j < 11; j++){
                if (array[i][j]!=0){
                    sum++;
                }
            }
        }
        System.out.println("有效值的個數(shù)是：" +sum);
        //創(chuàng)建一個稀疏數(shù)組   第一行存放：  行數(shù)  列數(shù)  有效數(shù)個數(shù)
       int[][] array2 = new int[sum+1][3];
       array2[0][0] = 11;  //行數(shù)
       array2[0][1] = 11;  //列數(shù)
       array2[0][2] = sum; //有效數(shù)個數(shù)
        //遍歷原始二維數(shù)組，將非零數(shù)組存入稀疏數(shù)組中
        //加入Java開發(fā)交流君樣：593142328一起吹水聊天
        int count = 0;
        for (int i = 0; i < array.length; i++) {
            for (int j = 0;j < array[i].length; j++){
                if (array[i][j]!=0){
                    count++;
                    array2[count][0] = i;
                    array2[count][1] = j;
                    array2[count][2] = array[i][j];
                }
            }
        }
        System.out.println("輸出稀疏數(shù)組");
        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();
        }
    }
}