牛客网剑指offer-顺时针打印矩阵

题目描述

输入一个矩阵，按照从外向里以顺时针的顺序依次打印出每一个数字，例如，如果输入如下矩阵： 1 2 3 4 5 6 7 8 9 10 11 1213 14 15 16 则依次打印出数字1,2,3,4,8,12,16,15,14,13,9,5,6,7,11,10.

class Solution {
public:
    //直接模拟
    vector<int> printMatrix(vector<vector<int> > matrix) {
        vector<int> ans;
        if (matrix.size() == 0)
            return ans;
        int top, bottom, left, right;
        top = left = 0;
        bottom = matrix.size()-1;
        right = matrix[0].size()-1;
        //四个方向的坐标变化，对应(横纵坐标)
        int dir[4][2] = {{0,1},{1,0},{0,-1},{-1,0}};
        //四个方向走到底后边界的变化，对应(上下左右边界)
        int change[4][4]{{1,0,0,0},{0,0,0,-1},{0,-1,0,0},{0,0,1,0}};
        int now = 0, x = 0, y = 0;
        ans.push_back(matrix[0][0]);
        while (top <= bottom && left <= right)
        {
            int dx = x + dir[now][0], dy = y + dir[now][1];
            //检查当前方向是否可以继续
            if (dx >= top && dx <= bottom && dy <= right && dy >= left)
            {
                x = dx, y = dy;
                ans.push_back(matrix[x][y]);
            }
            //走到边界了，改变方向并修改边界限制
            else
            {
                top += change[now][0];
                bottom += change[now][1];
                left += change[now][2];
                right += change[now][3];
                now = (now + 1) % 4;
            }
        }
        return ans;
    }
};