随机生成一个n*n的矩阵，并求出主、副对角元素之和，矩阵中的最大最小值（java实现）

随机生成一个n*n的矩阵，并求出主、副对角元素之和，矩阵中的最大最小值

1.随机生成一个矩阵：

public static int[][] CreateSixMatrix(int n) {
        int [][]matrix = new int[n][n];

        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                matrix[i][j] = (int) (Math.random() * 100);
                System.out.print(matrix[i][j] + "\t");
            }
            System.out.println();
        }

        return matrix;
    }

2.求主、副对角线元素之和

public static void SumDiagonal(int [][] matrix)
    {
        int SumNumber_1=0;
        int SumNumber_2=0;

        for(int i=0;i< matrix.length;i++)
        {
            for(int j=0;j<matrix.length;j++)
            {
                if(i==j)//主对角线
                   SumNumber_1+=matrix[i][j];
                if(i+j==matrix.length-1)//副对角线
                    SumNumber_2+=matrix[i][j];
            }
        }
        System.out.println("主对角元素之和："+SumNumber_1);
        System.out.println("副对角元素之和："+SumNumber_2);
       
    }

3.求矩阵中的最大值、最小值

public static void FindMaxAndMinNumber(int[][] matrix) {
        int max = 0;
        int min = 100;
        for (int i =0;i<matrix.length;i++) {
            for (int j = 0; j < matrix.length; j++) {
                if (matrix[i][j] > max) {
                    max = matrix[i][j];
                }
                if (matrix[i][j] < min) {
                    min = matrix[i][j];
                }
            }
        }
        System.out.println("max=" + max);
        System.out.println("min=" + min);

    }

4.完整java代码（附运行结果）

public class CreateMatrix {
    public static int[][] CreateSixMatrix(int n) {
        int [][]matrix = new int[n][n];

        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                matrix[i][j] = (int) (Math.random() * 100);
                System.out.print(matrix[i][j] + "\t");
            }
            System.out.println();
        }

        return matrix;
    }

    public static void FindMaxAndMinNumber(int[][] matrix) {
        int max = 0;
        int min = 100;
        for (int i =0;i<matrix.length;i++) {
            for (int j = 0; j < matrix.length; j++) {
                if (matrix[i][j] > max) {
                    max = matrix[i][j];
                }
                if (matrix[i][j] < min) {
                    min = matrix[i][j];
                }
            }
        }
        System.out.println("max=" + max);
        System.out.println("min=" + min);

    }
    
    public static void SumDiagonal(int [][] matrix)
    {
        int SumNumber_1=0;
        int SumNumber_2=0;

        for(int i=0;i< matrix.length;i++)
        {
            for(int j=0;j<matrix.length;j++)
            {
                if(i==j)//主对角线
                   SumNumber_1+=matrix[i][j];
                if(i+j==matrix.length-1)//副对角线
                    SumNumber_2+=matrix[i][j];
            }
        }
        System.out.println("主对角元素之和："+SumNumber_1);
        System.out.println("副对角元素之和："+SumNumber_2);

    }
    
    public static void main(String[] args)
    {
        int n=6;
        int [][]matrix=CreateSixMatrix(n);
        FindMaxAndMinNumber(matrix);
        SumDiagonal(matrix);
    }

}

运行结果