c++:顺时针打印矩阵

题目出自剑指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) {
vector<int> vec;
     int row=matrix.size();
     int col=matrix[0].size();
     if (row == 0 || col == 0)  return vec;
     int left = 0, top = 0, right = col - 1, bottom = row - 1;

        while(left<=right&&top<=bottom){
        for(int i=left;i<=right;i++)
            vec.push_back(matrix[top][i]);
         for (int i = top + 1; i <= bottom; ++i)
                vec.push_back(matrix[i][right]);
        if (top != bottom)
            for (int i = right - 1; i >= left; --i) 
                vec.push_back(matrix[bottom][i]);
         if (left != right)
            for (int i = bottom - 1; i > top; --i) 
                vec.push_back(matrix[i][left]);
         left++;
         top++;
         right--;
         bottom--;
        }
        return vec;
    }
};

巧妙之处在于设置了四个方位角
注意的是在四个方向上遍历时的起始点和终止点。