AcWing 756. 蛇形矩阵
原题链接
简单
include [HTML_REMOVED]
using namespace std;
int A[100][100];
int main(){
int n,m;
cin>>n>>m;
int dx[]={0, 1, 0, -1};
int dy[]={1, 0, -1, 0};//对应向东,向南,向西,向北,初始化为向东
for(int x = 0,y = 0,d = 0, k = 1; k <= n*m; k++)
{
A[x][y]=k;
int a =x + dx[d], b = y + dy[d]; //设置偏移量
if(a < 0 || a >= n || b < 0 || b >= m || A[a][b])//特殊情况
{
d = (d + 1) % 4;//数组4个单位,例如东转南,(0,1)变(1,0)
a =x + dx[d] , b = y + dy[d];
}
x = a , y = b;//对应偏移量赋给x,y,K对应每次加1;
}
for(int i = 0; i < n; i++)
{
for(int j = 0; j < m ; j++)
cout<<A[i][j]<<' ';
cout<<endl;
}
return 0;
}