顺时针打印矩阵

https://www.cnblogs.com/wanglei5205/p/8617424.html

#include <iostream>

using namespace std;

int main()
{
    int n,m,i,j;
    cin>>n>>m;
    int **matrix=new int* [n];
    for(i=0;i<n;i++)
        matrix[i]=new int [m];
    for(i=0;i<n;i++)
        for(j=0;j<m;j++)
            cin>>matrix[i][j];
    int up,down,left,right;
    up=0;
    down=n-1;
    left=0;
    right=m-1;
    while(up<=down&&left<=right)
    {
        for(i=left;i<=right;i++)
            cout<<matrix[up][i];
        if(up<down)
            {for(j=up+1;j<=down;j++)
                cout<<matrix[j][right];
             if(left<right)
                {for(i=right-1;i>=left;i--)
                    cout<<matrix[down][i];
                 if(up+1<down)
                    for(j=down-1;j>=up+1;j--)
                        cout<<matrix[j][left];
                }
            }
        up++;
        left++;
        right--;
        down--;
    }
}