矩阵操作 Java

package com.patience.interview.huawei;

import java.util.Scanner;

/**
 * 矩阵操作
 * @author Green.Gee
 * @date 2022/12/13 11:07
 * @email green.gee.lu@gmail.com
 */
public class MatrixOpt {


    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        // 注意 hasNext 和 hasNextLine 的区别
        while (in.hasNext()) { // 注意 while 处理多个 case

            // INIT
            int m = in.nextInt();
            int n = in.nextInt();
            if(m > 9 || n > 9){
                System.out.println(-1);
            }else{
                int[][] matrix = new int[m][n];
                for(int i = 0; i < m; i++){
                    for(int j = 0; j < n; j++){
                        matrix[i][j] = j;
                    }
                }
                System.out.println(0);
            }

            // CHANGE POSITION
            int x1 = in.nextInt();
            int y1 = in.nextInt();
            int x2 = in.nextInt();
            int y2 = in.nextInt();
            int flag = -1;
            if(x1 <= m - 1 && y1 <= n - 1){
                if(x2 <= m - 1 && y2 <= n - 1){
                    flag = 0;
                }
            }else{
                flag = -1;
            }
            System.out.println(flag);

            // ADD ROW
            int row = in.nextInt();
            if(m + 1 > 9 || row >= m){
                System.out.println(-1);
            }else{
                System.out.println(0);
            }

            // ADD COL
            int col = in.nextInt();
            if(n + 1 > 9 || col >= n){
                System.out.println(-1);
            }else{
                System.out.println(0);
            }

            // get V
            int x = in.nextInt();
            int y = in.nextInt();
            if(x > 9 || y > 9){
                System.out.println(-1);
            }else{
                if(x > m - 1 || y > n - 1){
                    System.out.println(-1);
                }else
                    System.out.println(0);
            }
        }
    }
}