剑指offer--26.顺时针打印矩阵

class Solution {
    public:
        vector<int> printMatrix(vector<vector<int> > matrix) {
            if(matrix.empty() || matrix.size() == 1)  return matrix[0];
            vector<int> ans;
            while(!matrix.empty()) {
                for(int x:matrix[0]) {
                    ans.push_back(x);
                }
                vector<vector<int>> cp;
                for(int i=0; i<matrix[0].size(); i++) {
                    vector<int> tmp;
                    for(int j=1; j<matrix.size(); j++) {
                        tmp.push_back(matrix[j][i]);
                    }
                    cp.push_back(tmp);
                }
                reverse(cp.begin(), cp.end());
                matrix = cp;
            }
            return ans;
        }
};