public static void main(String[] args) {
    for (int i=0;i<args.length;i++){
      System.out.println("args["+i+"]:"+args[i]);
    }
  }//傳遞命令行參數(shù)給main函數(shù)

public static void main(String[] args) {
    //調(diào)用
    printMax(34,3,3,2,56.5);
    printMax(new double[]{1,2,3});
  }

  public static void printMax(double... numbers){//可變參數(shù)
    if (numbers.length==0){
      System.out.println("No argument passed");
      return;
    }

    double result=numbers[0];

    //排序
    for (int i = 1; i < numbers.length; i++) {
      if(numbers[i]>result){
        result=numbers[i];
      }
    }
    System.out.println("The max value is "+result);
  }

public static int f(int n){
    if(n==1){
      return 1;
    }else {
      return n*f(n-1);
    }
  }

//反轉(zhuǎn)數(shù)組
	public static int[] reverse(int[] arrays){
    int[] result = new int[arrays.length];
    for (int i = 0,j=result.length-1; i <arrays.length ; i++,j--) {
      result[j]=arrays[i];
    }
    return result;
  }

  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++) {//i表示已經(jīng)排好的數(shù)字個(gè)數(shù)，所以在內(nèi)層循環(huán)時(shí)減去i，減少比較次數(shù)
        if(array[j+1]<array[j]){
          temp=array[j];
          array[j]=array[j+1];
          array[j+1]=temp;
        }
      }
    }
    return array;
  }

//看代碼才能看懂
  public static void main(String[] args) {
    //稀疏數(shù)組
    int[][] array1=new int[11][11];
    array1[1][2]=1;
    array1[2][3]=2;

    System.out.println("輸出原始數(shù)據(jù)：");

    for (int[] ints:array1) {
      for(int anint:ints){
        System.out.print(anint+"\t");
        //輸出原始數(shù)組
      }
      System.out.println();
    }
    System.out.println("================");
    //轉(zhuǎn)換為稀疏數(shù)組
    //獲取數(shù)組中有效值
    int sum= 0;
    for (int i = 0; i < 11; i++) {
      for (int j = 0; j < 11; j++) {
        if(array1[i][j]!=0){
          sum++;
        }
      }
    }
    System.out.println("有效值個(gè)數(shù)："+sum);

    //創(chuàng)建稀疏數(shù)組
    int[][] array2=new int[sum+1][3];
    array2[0][0]=11;
    array2[0][1]=11;
    array2[0][2]=sum;
    //遍歷二維數(shù)組，將有效值存在稀疏數(shù)組中
    int count=0;
    for (int i = 0; i < array1.length; i++) {
      for (int j = 0; j < array1[i].length; j++) {//二維數(shù)組每一行的長度
        //形成稀疏數(shù)組
        if(array1[i][j]!=0){
          count++;
          array2[count][0]=i;
          array2[count][1]=j;
          array2[count][2]=array1[i][j];
        }
      }
    }
    //輸出稀疏數(shù)組
    System.out.println("稀疏數(shù)組");

    for (int i = 0; i < array2.length; i++) {
      System.out.println(array2[i][0]+"\t"
          +array2[i][1]+"\t"
          +array2[i][2]+"\t");
    }

    System.out.println("================");
    System.out.println("還原");
    int[][] array3=new int[array2[0][0]][array2[0][1]];

    //還原值
    for (int i = 1; i < array2.length; i++) {
      //在還原數(shù)組中將坐標(biāo)與值相對應(yīng)
      array3[array2[i][0]][array2[i][1]]=array2[i][2];
    }

    //打印輸出
    System.out.println("輸出還原數(shù)組：");

    for (int[] ints:array3) {
      for(int anint:ints){
        System.out.print(anint+"\t");
        //輸出還原數(shù)組
      }
      System.out.println();
    }
  }