leetcode48_旋转图像

public void rotate(int[][] matrix) {
    int n = matrix.length, m= n-1;
    for(int i = 0; i < n/2; i++) {
        for(int j = 0; j < n/2; j++) {
            int tmp = matrix[i][j];
            matrix[i][j] = matrix[m-j][i];
            matrix[m-j][i] = matrix[m-i][m-j];
            matrix[m-i][m-j] = matrix[j][m-i];
            matrix[j][m-i] = tmp;
        }
    }
    if(n % 2 == 1) {
        for(int k = 0; k < n/2; k++) {
            int tmp = matrix[n/2][k];
            matrix[n/2][k] = matrix[m-k][n/2];
            matrix[m-k][n/2] = matrix[m-n/2][m-k];
            matrix[m-n/2][m-k] = matrix[k][m-n/2];
            matrix[k][m-n/2] = tmp;
        }
    }
}
``
posted @ 2022-02-06 21:32  明卿册  阅读(16)  评论(0编辑  收藏  举报