蛇形算法学习

public static void main(String[] args) {

    int dx[] = {-1,0,1,0}; int dy[] = {0,1,0,-1};

    int q[][] = new int[20][20];

    int n = 4,m = 4,x = 0,y = 0,a = 0,b = 0,d = 1;
    for (int i = 1;i<=n*m;i++){
        q[x][y] = i;
        
        System.out.println(x+","+y+","+q[x][y]);
        a = x+dx[d];
        b = y+dy[d];
        if (a<0 || b<0 ||a>=n ||b>=m || q[a][b] > 0) {
            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++) {
            System.out.print(q[i][j]);
            System.out.print(",");
        }
        System.out.println();
    }
}

结果：

1,2,3,4,
12,13,14,5,
11,16,15,6,
10,9,8,7,