AcWing 756. 蛇形矩阵

AcWing 756. 蛇形矩阵

#include <iostream>
using namespace std;

const int N = 110;
int n, m;
int q[N][N];

//记录四个方向的偏移量
const int dx[] = {-1, 0, 1, 0}, dy[] = {0, 1, 0, -1};

int main()
{
    cin >> n >> m;
    //四个方向上右下左分别记为0 1 2 3
    //首先向右进行填数
    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 >= n || a < 0 || b < 0 || b >= m || q[a][b]){
            d = (d + 1) % 4;
            a = x + dx[d], b = y + dy[d];
        }
        x = a, y = b;
    }
    for(int i = 0; i < n; i++){
        for(int j = 0; j < m; j++){
            cout << q[i][j] << ' ';
        }
        cout << endl;
    }
    return 0;
}