U71529 顺时针排序矩阵

男娘i 2022-01-16 04:39 128阅读 0赞

[2019独角兽企业重金招聘Python工程师标准>>> ][2019_Python_] ![hot3.png][]

# 题目描述 #

输出将1~n\*n顺时针排列矩阵

# 输入格式 #

测试数据有T组，每组输入正整数n>0

# 输出格式 #

输出将1~n\*n顺时针排列矩阵,就是输出的字符串宽度为4，不足的会用空格补足

# 输入输出样例 #

1
    3
    4

# 输出样例 #

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

# 自己写的答案 #

#include <iostream>
    #include <algorithm>
    using namespace std;
    
    #define UP -1
    #define DOWN 0
    #define LEFT 1
    #define RIGHT 2
    
    int main() {
        int t;
        cin >> t;
        for (int i = 0; i < t; ++i) {
            int x;
            cin >> x;
            int graph[10][10];
            for (int j = 0; j < x; ++j) {
                for (int k = 0; k < x; ++k) {
                    graph[j][k] = 0;
                }
            }
            // init orientation
            int dir = DOWN;
            // init num
            int num = 1;
            // init coordinate
            int a = 0;
            int b = x - 1;
    
            while (true) {
                graph[a][b] = num;
                if (num == x * x) {
                    break;
                }
                num++;
                if (dir == DOWN) {
                    // 碰壁
                    if (a + 1 >= x || graph[a + 1][b] != 0) {
                        b--;
                        dir = LEFT;
                    } else {
                        a++;
                    }
                } else if (dir == LEFT) {
                    // 碰壁
                    if (b - 1 < 0 || graph[a][b - 1] != 0) {
                        a--;
                        dir = UP;
                    } else {
                        b--;
                    }
                } else if (dir == UP) {
                    // 碰壁
                    if (a - 1 < 0 || graph[a - 1][b] != 0) {
                        b++;
                        dir = RIGHT;
                    } else {
                        a--;
                    }
                } else {
                    // 碰壁
                    if (b + 1 >= x || graph[a][b + 1] != 0) {
                        a++;
                        dir = DOWN;
                    } else {
                        b++;
                    }
                }
            }
            for (int j = 0; j < x; ++j) {
                for (int k = 0; k < x; ++k) {
                    cout << graph[j][k] << " ";
                }
                cout << endl;
            }
        }
    }

转载于:https://my.oschina.net/StupidZhe/blog/3050707

[2019_Python_]: https://my.oschina.net/u/2663968/blog/3061697
[hot3.png]: /images/20220114/a70374acd92a47849a6469ec49e8a576.png