Java 2D数组(矩形矩阵)对角线移动的总和路径，直到你撞到墙，重复直到你撞到一个角落

public class DiagonalPath {
    public static void main(String[] args) {
        int[][] matrix = {{1, 2, 3}, {4, 5, 6}, {7, 8, 9}};

        int row = 0, column = 0;
        int sum = 0;

        while (true) {
            sum += matrix[row][column];

            if (row == 0 && column == matrix[0].length - 1) {
                column--;
            } else if (row == matrix.length - 1 && column == 0) {
                row--;
            } else if (row == matrix.length - 1 && column == matrix[0].length - 1) {
                row++;
            } else {
                row--;
                column++;
            }

            if (row < 0 || column < 0 || row >= matrix.length || column >= matrix[0].length) {
                break;
            }
        }

        System.out.println("Total sum: " + sum);
    }
}