Find the largest number of two-dimensional arrays

      
      

       
       import 
       
       java.
       
       util.
       
       Arrays;
       
       

       
       

       
       

       
       public 
       
       class 
       
       NUm {
       
       

       
       
    
       
       public 
       
       static 
       
       void 
       
       main(
       
       String[] 
       
       args) 
       
       throws 
       
       InterruptedException {
       
       
        
       
       int[][] 
       
       num 
       
       = 
       
       new 
       
       int[
       
       5][
       
       5];
       
       
        
       
       int 
       
       temp2 
       
       = 
       
       0;
       
       
        
       
       //  Initialize array 
       
       
        
       
       Array.
       
       borth(
       
       num[
       
       0]);
       
       
        
       
       Array.
       
       borth(
       
       num[
       
       1]);
       
       
        
       
       Array.
       
       borth(
       
       num[
       
       2]);
       
       
        
       
       Array.
       
       borth(
       
       num[
       
       3]);
       
       
        
       
       Array.
       
       borth(
       
       num[
       
       4]);
       
       
        
       
       System.
       
       out.
       
       println(
       
       "num Array ："
       
       +
       
       Arrays.
       
       deepToString(
       
       num));
       
       
        
       
       for(
       
       int 
       
       i 
       
       = 
       
       0; 
       
       i 
       
       < 
       
       num.
       
       length; 
       
       i
       
       ++){
       
       
            
       
       for(
       
       int 
       
       n 
       
       = 
       
       0; 
       
       n 
       
       < 
       
       num[
       
       i].
       
       length
       
       -
       
       1; 
       
       n
       
       ++){
       
       
                
       
       int 
       
       temp 
       
       = 
       
       num[
       
       i][
       
       n];
       
       
                
       
       if(
       
       temp 
       
       > 
       
       num[
       
       i][
       
       n]){
       
       
                    
       
       temp2 
       
       = 
       
       temp;
       
       
                }
       
       else {
       
       
                    
       
       if(
       
       temp2 
       
       < 
       
       num[
       
       i][
       
       n])
       
       
                        
       
       temp2 
       
       = 
       
       num[
       
       i][
       
       n];
       
       
                }
       
       
            }
       
       
        }
       
       
        
       
       System.
       
       out.
       
       println(
       
       "num The largest value in the array is ：" 
       
       + 
       
       temp2);
       
       
    }
       
       
}
       
       

       
       

       
       //  Generate an array , The length is 5
       
       

       
       class 
       
       Array{
       
       
    
       
       public 
       
       static 
       
       void 
       
       borth(
       
       int[] 
       
       o){
       
       
        
       
       for (
       
       int 
       
       i
       
       = 
       
       0; 
       
       i 
       
       < 
       
       o.
       
       length;
       
       i
       
       ++){
       
       
            
       
       int 
       
       num 
       
       = (
       
       int) (
       
       Math.
       
       random() 
       
       * 
       
       100);
       
       
            
       
       o[
       
       i] 
       
       = 
       
       num;
       
       
        }
       
       
    }
       
       
}
      
      
      
      

       
       
1.
       
       
2.
       
       
3.
       
       
4.
       
       
5.
       
       
6.
       
       
7.
       
       
8.
       
       
9.
       
       
10.
       
       
11.
       
       
12.
       
       
13.
       
       
14.
       
       
15.
       
       
16.
       
       
17.
       
       
18.
       
       
19.
       
       
20.
       
       
21.
       
       
22.
       
       
23.
       
       
24.
       
       
25.
       
       
26.
       
       
27.
       
       
28.
       
       
29.
       
       
30.
       
       
31.
       
       
32.
       
       
33.
       
       
34.
       
       
35.
       
       
36.
       
       
37.
       
       
38.
       
       
39.