Day 3 ——蛇形矩阵（偏移量技巧）

AcWing 756.蛇形矩阵

通过记下四个方向的偏移量，来简化问题，省去繁琐的多重循环，降低时间复杂度。 

 

#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}; //x，y四个方向的偏移量
    int x = 0,y = 0,d = 1;  //d表示第几个偏移量
    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]) //撞墙的情况
        {
            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;
}