不用辅助数组实现矩阵顺时针旋转90°

You are given an n x n 2D matrix representing an image. Rotate the
image by 90 degrees (clockwise). Follow up: Could you do this
in-place?

解题思路：

本题要求我们对矩阵进行90°旋转.
1.求出矩阵的左上角坐标以及右下角坐标，然后我们对矩阵的顶点进行旋转，旋转后在对矩阵最外圈的其他元素进行旋转
2.遍历完最外圈后再依次对矩阵的内圈进行旋转
3.必定是方阵，否则旋转后会出现数组越界

package chap1;
public class matrix_transpose {
    public static void rotate(int[][] matrix){
        int lr = 0;
        int lc = 0;
        int rr = matrix.length-1;
        int rc = matrix[0].length-1;
        while(lc < rc){
            rotateEdge(matrix,lr++,lc++,rr--,rc--);
        }
    }
    public static void rotateEdge(int[][]matrix,int lr,int lc,int rr,int rc  ){
        int times = rc-lc;//表示一圈要进行几次交换
        for (int i = 0;i<times;i++){
            int lUp = matrix[lr][lc+i]; //左上方的点
            int rUp = matrix[lr+i][rc];//右上方的点
            int rDown = matrix[rr][rc-i];//右下方的点
            int lDown = matrix[rr-i][lc];//左下方的点
            int temp = matrix[lr][lc+i];
            matrix[lr][lc+i] = matrix[rr-i][lc];
            matrix[rr-i][lc] = matrix[rr][rc-i];
            matrix[rr][rc-i] = matrix[lr+i][rc];
            matrix[lr+i][rc] = temp;
        }

    }
    public static void printMatrix(int[][] matrix) {
        for (int i = 0; i != matrix.length; i++) {
            for (int j = 0; j != matrix[0].length; j++) {
                System.out.print(matrix[i][j] + " ");
            }
            System.out.println();
        }
    }
    public static void main(String[] args) {
        int[][] matrix = { { 1, 2, 3, 4 }, { 5, 6, 7, 8 }, { 9, 10, 11, 12 },
                { 13, 14, 15, 16 } };
        printMatrix(matrix);
        rotate(matrix);
        System.out.println("=============");
        printMatrix(matrix);
    }
}