LeetCode 1329按矩陣對角線排序(java)

class Solution {
    public int[][] diagonalSort(int[][] mat) {
        int m = mat.length, n = mat[0].length;
         for(int k = 0; k < Math.min(m, n); k++) {
             for(int i = 0; i< m - 1; i++) {
                 for(int j = 0; j < n - 1; j++) {
                     if(mat[i][j] > mat[i + 1][j + 1]) {
                          int temp = mat[i][j];
                         mat[i][j] = mat[i +1][j + 1];
                        mat[i + 1][j +1] = temp;
                     }
                   
                 }
             }
         }
        return mat;
    }
}