顺时针打印数组

顺时针打印数组

思路

• 依次按照四个方向遍历一次，如果计数值到达数组个数，则退出，无需考虑其他的停止条件。

代码

#include <cstdlib>
#include <string>
#include <iostream>
#include <fstream>
#include <vector>
#include <sstream>
#include <unordered_map>
#include <unordered_set>
#include <map>
#include <set>
#include <stdio.h>
#include <numeric>
#include <algorithm>
#include <functional>
#include <stack>
#include <queue>

using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
typedef unsigned char uchar;

int dirs[8][2] = { -1, -1, -1, 0, -1, 1, 0, -1, 0, 1, 1, -1, 1, 0, 1, 1 };

#define MAX_DIST 1e9

int main(int /*argc*/, char** /*argv*/)
{
    int rows = 5, cols = 3;
    vector<vector<int>> nums( rows, vector<int>(cols,0) );
    for (int i = 0; i < rows; ++i)
    {
        for (int j = 0; j < cols; ++j)
        {
            nums[i][j] = j + i*cols;
            printf("%d ", nums[i][j]);
        }
        printf("\n");
    }   

    int sum_num = rows * cols;
    int start_row = 0, end_row = rows - 1, start_col = 0, end_col = cols - 1;
    int cnt = 0;
    int curr_row = 0, curr_col = 0;
    while ( true )
    {
        // 向右遍历
        for (int i = start_col; i <= end_col; ++i)
        {
            printf("%d,", nums[start_row][i]);
            ++cnt;
        }
        if (cnt >= sum_num)
            break;
        ++start_row;

        // 向下遍历
        for (int i = start_row; i <= end_row; ++i)
        {
            printf("%d,", nums[i][end_col]);
            ++cnt;
        }
        if (cnt >= sum_num)
            break;
        --end_col;

        // 向左遍历
        for (int i = end_col; i >= start_col; i--)
        {
            printf("%d,", nums[end_row][i]);
            ++cnt;
        }
        if (cnt >= sum_num)
            break;
        --end_row;

        // 向上遍历
        for (int i = end_row; i >= start_row; --i)
        {
            printf("%d,", nums[i][start_col]);
            ++cnt;
        }

        if (cnt >= sum_num)
            break;
        ++start_col;

    }

    system("pause");
    return 0;
}