回形遍历数组

描述

给定一个row行col列的整数数组array，要求从array[0][0]元素开始，按回形从外向内顺时针顺序遍历整个数组。如图所示：

输入输入的第一行上有两个整数，依次为row和col。
余下有row行，每行包含col个整数，构成一个二维整数数组。
（注：输入的row和col保证0 < row < 100, 0 < col < 100）输出按遍历顺序输出每个整数。每个整数占一行。样例输入

4 4
1 2 3 4
12 13 14 5
11 16 15 6
10 9 8 7

样例输出

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16

#include <iostream>
#include <string>
#include <memory.h>
#include <stdio.h>
using namespace std;

int a[105][105];
int main()
{
	int n,m;
    cin >> n >> m;
    for( int i = 1; i <= n ; i++ )
        for( int j = 1; j <= m; j++ )
        cin >> a[i][j];
        
    int row = 1, col = 1;
    while( row <= n || col <= m )
    {
        for( int i = row, j = col; j <= m && row <= n; j++ )
            cout << a[i][j] << endl;
        row++;
        for( int i = row, j = m; i <= n && col <= m; i++ )
            cout << a[i][j] << endl;
        m--;
        for( int i = n, j = m; j >= col && row <= n; j-- )
            cout << a[i][j] << endl;
        n--;
        for( int i = n, j = col; i >= row && col <= m; i-- )
            cout << a[i][j] << endl;
        col++;
    }
    return 0;
}