思路:
一般来说暂时我想到的就两种思路.
一种是运用坐标加上dx[]和dy[]数组来进行移动判断,dx[] = {-1,0,1,0},dy[] = {0,1,0,-1};
第二种是模拟法,设置好上下左右的边界,每次换方向就改变边界的条件.
详细代码:
#include<iostream>
using namespace std;
const int N = 110;
int n,m;
int q[N][N];
int main(){
cin >> n >> m;
int dx[] = {-1,0,1,0},dy[] = {0,1,0,-1};
int x = 0, y = 0,d = 1;
for(int i = 1;i<=n * m;i++)
{
q[x][y] = i;
int a = x + dx[d],b = y + dy[d];
if(a < 0 || a >= n || b < 0 || b >= m || q[a][b])
//如果a小于边界,或者a超出边界,或者b小于边界,或者b超出边界,或者当前位置已经被访问过了
{
d = (d + 1) % 4;//重新换方向
a = x + dx[d],b = y + dy[d];//赋上新的值
}
x = a, y = b;//带入给x,y
}
for(int i = 0;i<n;i++)
{
for(int j = 0;j<m;j++)
{
cout << q[i][j] << " ";
}
cout << endl;
}
}