剑指offer顺时针打印矩阵

剑指offer顺时针打印矩阵

class Solution {
public:
    vector<int> printMatrix(vector<vector<int> > matrix) {
        vector<int> res;
        if(matrix.size() == 0 || matrix[0].size() == 0) return res;
        int top = 0; 
        int bottom = matrix.size() - 1;
        int left = 0;
        int right = matrix[0].size() - 1;
        while(top <= bottom && left <= right) {
            //从左到右
            for(int i = left; i <= right; i++) {
                res.push_back(matrix[top][i]);
            }
            top++; 
            if(top > bottom) break;
            //从上到下
            for(int i = top; i <= bottom; i++) {
                res.push_back(matrix[i][right]);
            }
            right--;
            if(right < left) break;
            //从右到左
            for(int i = right; i >= left; i--) {
                res.push_back(matrix[bottom][i]);
            }
            bottom--;
            if(bottom < top) break;
            //从下到上
            for(int i = bottom; i >= top; i--) {
                res.push_back(matrix[i][left]);
            }
            left++;
            if(left > right) break;
        }
        return res;
    }
};