题目描述
给定一个包含 m x n 个元素的矩阵(m 行, n 列),请按照顺时针螺旋顺序,返回矩阵中的所有元素。
示例:
输入:
[
[ 1, 2, 3 ],
[ 4, 5, 6 ],
[ 7, 8, 9 ]
]
输出: [1,2,3,6,9,8,7,4,5]
参考答案:
int* spiralOrder(int* matrix, int matrixRowSize, int matrixColSize){
…//补充函数,返回结果(一维数组)的首元素指针
}
int main(){
int a[3][3]={1,2,3,4,5,6,7,8,9};
int matrixRowSize=3,matrixColSize=3;
int *returnnum=spiralOrder(a[0], matrixRowSize, matrixColSize);
int *p;
for(p=returnnum;p<returnnum+9;p++)
{
printf(“%4d”,*p);
}
return 0;
}
代码
使用语言:C
#include<stdio.h>
int* spiralOrder(int matrix[50][50], int m, int n);
int b[1000] = {0};//在全局命名。在自定义函数中命名的话,函数运行结束,数组空间就被释放了
int main() {
int a[50][50] = {0};
int m, n;
scanf("%d%d", &m, &n);
int i, j;
for (int i = 0; i < m; i++) {
for (int j = 0; j < n; j++) {
scanf("%d", &a[i][j]);
}
}
int *returnnum = spiralOrder(a, m, n);
int *p;
for (p = returnnum; p < returnnum +m*n; p++) {
printf("%4d", *p);
}
return 0;
}
int* spiralOrder(int matrix[50][50], int m, int n) {//顺时针螺旋输出函数
int i, j;
int p = n, q = m;
int count = 0;//已输出个数
int length;
for (i = 0, j = 0; j < n; ++j) { //第一次向右
b[count++] = matrix[i][j];
}
j -= 1; //for循环结束后j=3
while (1) {
i += 1; //转角避免重复输入
for (length = 0; ; ++i) { //向下
b[count++] = matrix[i][j];
length++;
if (length == q - 1)
break;
}
if (count == m * n)
break;
q--;
j -= 1;
for (length = 0; ; j--) { //向左
b[count++] = matrix[i][j];
length++;
if (length == p - 1)
break;
}
if (count == m * n)
break;
p--;
i -= 1;
for (length = 0;; i--) { //向上
b[count++] = matrix[i][j];
length++;
if (length == q - 1)
break;
}
if (count == m * n)
break;
q--;
j += 1;
for (length = 0; ; j++) { //向右
b[count++] = matrix[i][j];
length++;
if (length == p - 1)
break;
}
if (count == m * n)
break;
p--;
}
return b;
}