数据结构(八十三)
学习数据结构与算法过程中的心得体会以及知识点的整理,方便我自己查找,也希望可以和大家一起交流。
—— 顺时针打印矩阵 ——
1.题目描述
输入一个矩阵,按照从外向里以顺时针的顺序依次打印出每一个数字。
示例
输入:
matrix = [[1,2,3],[4,5,6],[7,8,9]]
输出:
[1,2,3,6,9,8,7,4,5]
输入:
matrix = [[1,2,3,4],[5,6,7,8],[9,10,11,12]]
输出:
[1,2,3,4,8,12,11,10,9,5,6,7]
2.代码
c
/**
* Note: The returned array must be malloced, assume caller calls free().
*/
int* spiralOrder(int** matrix, int matrixSize, int* matrixColSize, int* returnSize){
if (matrixSize == 0) {
*returnSize = 0;
return NULL;
}
*returnSize = matrixSize * (*matrixColSize);
int *ans = (int*)calloc(*returnSize, sizeof(int));
int top = 0, down = matrixSize - 1,left = 0, right = matrixColSize[0] - 1,index = 0;
while (index < *returnSize) {
for (int i = left; index < *returnSize && i <= right; i++)
ans[index++] = matrix[top][i];
top++;
for (int i = top; index < *returnSize && i <= down; i++)
ans[index++] = matrix[i][right];
right--;
for (int i = right; index < *returnSize && i >= left; i--)
ans[index++] = matrix[down][i];
down--;
for (int i = down; index < *returnSize && i >= top; i--)
ans[index++] = matrix[i][left];
left++;
}
return ans;
}