剑指Offer：顺时针打印矩阵

题目描述

输入一个矩阵，按照从外向里以顺时针的顺序依次打印出每一个数字，例如，如果输入如下矩阵：
1 2 3 4
5 6 7 8
9 10 11 12
13 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)
    {
        int row = matrix.size();
        int col = matrix[0].size();
        int left = 0, right = col - 1, top = 0, bottom = row - 1;
        vector<int> result;
        while(right >= left && bottom >= top)
        {
            //from left to right
            for(int i = left; i <= right; i++)
            {
                result.push_back(matrix[left][i]);
            }
            //from up to down
            for(int i = top + 1; i <= bottom; i++)
            {
                result.push_back(matrix[i][right]);
            }
            //from right to left
            if (bottom != top)
            for(int i = right - 1; i > left; i--)
            {
                result.push_back(matrix[bottom][i]);
            }
            //from down to up
            if (left != right)
            for(int i = bottom; i > top; i--)
            {
                result.push_back(matrix[i][left]);
            }
            left++, right--, top++, bottom--;
        }
        return result;
    }
};