题解 | 顺时针旋转矩阵
顺时针旋转矩阵
https://www.nowcoder.com/practice/2e95333fbdd4451395066957e24909cc
/**
* 代码中的类名、方法名、参数名已经指定,请勿修改,直接返回方法规定的值即可
*
*
* @param mat int整型二维数组
* @param matRowLen int mat数组行数
* @param matColLen int* mat数组列数
* @param n int整型
* @return int整型二维数组
* @return int* returnSize 返回数组行数
* @return int** returnColumnSizes 返回数组列数
*/
int** rotateMatrix(int** mat, int matRowLen, int* matColLen, int n, int* returnSize, int** returnColumnSizes ) {
// write code here
int **res = (int **)malloc(sizeof(int*) * n);
for(int i = 0; i < n; i++) {
res[i] = (int *)malloc(sizeof(int) * n);
}
for (int i = 0; i < matRowLen; i++) {
for (int j = 0; j < *matColLen; j++) {
res[i][j] = mat[matRowLen - j - 1][i];
}
}
*returnSize = matRowLen;
*returnColumnSizes = matColLen;
return res;
}
查看14道真题和解析
