(java)输入一个正整数n(1≤n≤6)和n阶方阵A，交换方阵A中的最大值与最小值位置。假定方阵A中的最大值与最小值都唯一。

package com.qinyang.array;

import java.util.Scanner;

public class Demo02 {
    /*输入一个正整数n(1≤n≤6)和n阶方阵A，交换方阵A中的最大值与最小值位置。
    假定方阵A中的最大值与最小值都唯一。*/


    public static void main(String[] args) {
        Scanner s = new Scanner(System.in);
        int n = 0;
        int arr[][] = new int[10][10];

        System.out.println("请输入n的值：");
        n = s.nextInt();
        System.out.println("请输入"+n+"x"+n+"个元素：");
        putNum(n,arr);//输入数组元素
        swap(n,arr);//交换最大值和最小值
        outNum(n,arr);//输出数组元素

    }

    public static void putNum(int n,int[][] arr) {
        Scanner s = new Scanner(System.in);
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                arr[i][j] = s.nextInt();
            }
        }
    }

    public static void swap(int n,int[][] arr) {
        int max = arr[0][0];
        int min = arr[0][0];
        int x1 = 0;
        int y1 = 0;
        int x2 = 0;
        int y2 = 0;
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                if(arr[i][j] > max){
                    max = arr[i][j];
                    x1 = i;
                    y1 = j;
                }
                if(arr[i][j] < min){
                    min = arr[i][j];
                    x2 = i;
                    y2 = j;
                }
            }
        }
        int temp = arr[x1][y1];
        arr[x1][y1] = arr[x2][y2];
        arr[x2][y2] = temp;
    }

    public static void outNum(int n,int[][] arr) {
        Scanner s = new Scanner(System.in);
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                System.out.print(arr[i][j] + " ");
            }
            System.out.println();
        }
    }
}