[剑指offer]-顺时针打印矩阵

题目描述

输入一个矩阵，按照从外向里以顺时针的顺序依次打印出每一个数字，例如，如果输入如下4 X 4矩阵： 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> result;
        int row = matrix.size();
        if(row == 0)
            return result;
        int col = matrix[0].size();
        int top = 0;
        int down = row-1;
        int left = 0;
        int right = col-1;
        while(top <= down && left <= right){
            for(int i=left;i<=right;i++)
                result.push_back(matrix[top][i]);
            top++;
            if(top > down || left > right) break;
            for(int i=top;i<=down;i++)
                result.push_back(matrix[i][right]);
            right--;
            if(top > down || left > right) break;
            for(int i=right;i>=left;i--)
                result.push_back(matrix[down][i]);
            down--;
            if(top > down || left > right) break;
            for(int i=down;i>=top;i--)
                result.push_back(matrix[i][left]);
            left++;
            if(top > down || left > right) break;
        }
        return result;
    }
};