题解 | #顺时针旋转矩阵#
顺时针旋转矩阵
http://www.nowcoder.com/practice/2e95333fbdd4451395066957e24909cc
import java.util.*;
public class Solution { public int[][] rotateMatrix(int[][] mat, int n) { int[][] result = new int[n][n]; for (int j = 0; j < n; j++) { int[] array = new int[n]; int k = 0; for (int i = n - 1; i >= 0; i--) { array[k++] = mat[i][j]; } result[j] = array; } return result; } }
投递牛客等公司