blob: 9e747f02bd3ef372e9fbdf7cb753fe02eb1ee7c0 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
|
/**
* Note: The returned array must be malloced, assume caller calls free().
*/
#define MIN(a, b) ((a) > (b) ? (b) : (a))
int* spiralOrder(int** matrix, int matrixRowSize, int matrixColSize) {
int* result = malloc(sizeof(int) * matrixRowSize * matrixColSize);
int index = 0;
int offset;
int maxOffset = MIN(matrixRowSize, matrixColSize) / 2 + 1;
for(offset = 0; offset < maxOffset; offset++, matrixColSize-= 2, matrixRowSize-= 2) {
if(matrixRowSize == 0 || matrixColSize == 0)
break;
else if(matrixRowSize == 1) {
for(int i = 0; i < matrixColSize; i++)
result[index++] = matrix[offset][offset + i];
break;
} else if(matrixColSize == 1) {
for(int i = 0; i < matrixRowSize; i++)
result[index++] = matrix[offset + i][offset];
break;
} else {
for(int i = 0; i < matrixColSize; i++)
result[index++] = matrix[offset][offset + i];
for(int i = 1; i < matrixRowSize; i++)
result[index++] = matrix[offset + i][offset + matrixColSize - 1];
for(int i = 1; i < matrixColSize; i++)
result[index++] = matrix[offset + matrixRowSize - 1][offset + matrixColSize - 1 - i];
for(int i = 1; i < matrixRowSize - 1; i++)
result[index++] = matrix[offset + matrixRowSize - 1 - i][offset];
}
}
return result;
}
|
