2020.4.14

int arr[][] = { {3,5,4,6},{3,8,5,6},{14,13,12,15}};
        int max=arr[0][0];
         for (int i = 0; i < arr.length; i++) {
             for (int j = 0; j < arr[i].length; j++) {
                 if(arr[i][j]>max){
                     max=arr[i][j];
                 }
             }
         }
             System.out.println("二维数组中最大的是:"+max);
    }
}     
      
 
        
        

       

   
    
    

    


   
    

 

package ggd;
import java.util.*;

public class xcz {

    public static void main(String[] args) {
        // TODO Auto-generated method stub
        Scanner input = new Scanner(System.in);
           double arr[][] = { { 1, 2, 3, 4, 5 }, { 6, 7, 8, 9, 10 },
                     { 11, 12, 13, 14, 15 }, { 16, 17, 18, 19, 20 } };
              for (int i = 0; i < arr.length; i++) {
                  for (int j = 0; j < arr[i].length; j++) {
                      System.out.print(arr[i][j] + "\t");
                  } System.out.println();
              }
         }
      
        }


      
 
        
        

       

   
    
    

    

 

package ggd;
import java.util.*;

public class xcz {

    public static void main(String[] args) {
        // TODO Auto-generated method stub
        Scanner input = new Scanner(System.in);
        int[] arr= { 34, 22, 35, 67, 45, 66, 12, 33 };
        System.out.println("输入数字，查找它是否在数组中");
        int x ;
        int y = 0;
        for (int i = 0; i < arr.length; i++) {
        if (x == arr[i]) {
        System.out.println("下标为：" + i);
        y=1;
        }
        }
        if (y == 0) {
        System.out.println("not found");
        }
        }

}     
      

 

package ggd;
import java.util.*;

public class xcz {

    public static void main(String[] args) {
        // TODO Auto-generated method stub
        Scanner input = new Scanner(System.in);
          int[] arr = {1,8,7,3,5};
          for (int i = 0; i < arr.length; i++) {
              for (int j = 0; j < arr.length-1-i; j++) {
              int num = 0;
              if(arr[j] > arr[j+1]){
                  num = arr[j];
                  arr[j]= arr[j+1];
                  arr[j+1] = num;
               }
            }
          }
          for (int i : arr) {
              System.out.println(i);
          }
      
        }

}