回形遍历二维数组

吸取下思路

#include <iostream>
#include <string>
#include <memory.h>
#include <stdio.h>
using namespace std;
int row,col;
int num[105][105];
int main()
{
    cin >> row >> col;
    for( int i = 1; i <= row ; i++ )
        for( int j = 1; j <= col; j++ )
        cin >> num[i][j];
    int r_begin = 1, c_begin = 1;
    while( r_begin <= row || c_begin <= col )
    {
        for( int i = r_begin, j = c_begin; j <= col && r_begin <= row; j++ )
            cout << num[i][j] << endl;
        r_begin++;
        for( int i = r_begin, j = col; i <= row && c_begin <= col; i++ )
            cout << num[i][j] << endl;
        col--;
        for( int i = row, j = col; j >= c_begin && r_begin <= row; j-- )
            cout << num[i][j] << endl;
        row--;
        for( int i = row, j = c_begin; i >= r_begin && c_begin <= col; i-- )
            cout << num[i][j] << endl;
        c_begin++;
    }
    return 0;
}