hackhu2019#LeetCode#LeetCode面试题 01.07. 旋转矩阵1

# 面试题 01.07. 旋转矩阵 [题目链接](https://leetcode-cn.com/problems/rotate-matrix-lcci/) 解题思路：顺时针旋转 90° 对应转换规则 (x,y)->(y,n-x) ，n=N-1 ```java public void rotate(int[][] matrix) { if (matrix == null || matrix.length < 1) { return; } int n = matrix.length - 1; int[][] tempMatrix = new int[matrix.length][matrix.length]; for (int i = 0; i < ma