/**
* Note: The returned array must be malloced, assume caller calls free().
*/
int* spiralOrder(int** matrix, int matrixRowSize, int matrixColSize) {
if(matrixRowSize == 0 || matrixColSize == 0) return NULL;
int i, j, k = 0;
int *re = (int*)malloc(sizeof(int) * matrixRowSize * matrixColSize);
if(matrixRowSize == 1){
for(j = 0; j < matrixColSize; ++j)
re[k++] = matrix[0][j];
}
else if(matrixColSize == 1){
for(i = 0; i < matrixRowSize; ++i)
re[k++] = matrix[i][0];
}
else{
bool visit[matrixRowSize][matrixColSize];
for(i = 0; i < matrixRowSize; ++i)
for(j = 0; j < matrixColSize; ++j)
visit[i][j] = false;
for(j = 0; j < matrixColSize - 1; ++j){
re[k++] = matrix[0][j];
visit[0][j] = true;
}
for(i = 0; i < matrixRowSize - 1; ++i){
re[k++] = matrix[i][matrixColSize - 1];
visit[i][matrixColSize - 1] = true;
}
for(j = matrixColSize - 1; j > 0; --j){
re[k++] = matrix[matrixRowSize - 1][j];
visit[matrixRowSize - 1][j] = true;
}
for(i = matrixRowSize - 1; i > 0; --i){
re[k++] = matrix[i][0];
visit[i][0] = true;
}
if(matrixRowSize > 2 && matrixColSize > 2){
i = 1;
j = 1;
while(!visit[i][j]){
re[k++] = matrix[i][j];
visit[i][j] = true;
if(visit[i - 1][j] && !visit[i][j + 1]) ++j;
else if(visit[i][j + 1] && !visit[i + 1][j]) ++i;
else if(visit[i + 1][j] && !visit[i][j - 1]) --j;
else --i;
}
}
}
return re;
}
* Note: The returned array must be malloced, assume caller calls free().
*/
int* spiralOrder(int** matrix, int matrixRowSize, int matrixColSize) {
if(matrixRowSize == 0 || matrixColSize == 0) return NULL;
int i, j, k = 0;
int *re = (int*)malloc(sizeof(int) * matrixRowSize * matrixColSize);
if(matrixRowSize == 1){
for(j = 0; j < matrixColSize; ++j)
re[k++] = matrix[0][j];
}
else if(matrixColSize == 1){
for(i = 0; i < matrixRowSize; ++i)
re[k++] = matrix[i][0];
}
else{
bool visit[matrixRowSize][matrixColSize];
for(i = 0; i < matrixRowSize; ++i)
for(j = 0; j < matrixColSize; ++j)
visit[i][j] = false;
for(j = 0; j < matrixColSize - 1; ++j){
re[k++] = matrix[0][j];
visit[0][j] = true;
}
for(i = 0; i < matrixRowSize - 1; ++i){
re[k++] = matrix[i][matrixColSize - 1];
visit[i][matrixColSize - 1] = true;
}
for(j = matrixColSize - 1; j > 0; --j){
re[k++] = matrix[matrixRowSize - 1][j];
visit[matrixRowSize - 1][j] = true;
}
for(i = matrixRowSize - 1; i > 0; --i){
re[k++] = matrix[i][0];
visit[i][0] = true;
}
if(matrixRowSize > 2 && matrixColSize > 2){
i = 1;
j = 1;
while(!visit[i][j]){
re[k++] = matrix[i][j];
visit[i][j] = true;
if(visit[i - 1][j] && !visit[i][j + 1]) ++j;
else if(visit[i][j + 1] && !visit[i + 1][j]) ++i;
else if(visit[i + 1][j] && !visit[i][j - 1]) --j;
else --i;
}
}
}
return re;
}