Leetcode: Spiral Matrix

Given a matrix of m x n elements (m rows, n columns), return all elements of the matrix in spiral order.

For example,
Given the following matrix:

[ [ 1, 2, 3 ], [ 4, 5, 6 ], [ 7, 8, 9 ]]

You should return [1,2,3,6,9,8,7,4,5].

void printacircle(vector<vector<int> > &matrix, vector<int> &path, int num)    {    int row = matrix.size();int col = matrix[0].size();for(int i = num; i < col-num; i++)path.push_back(matrix[num][i]);if( 2*num+2 <= row)for(int i = num+1; i < row-num; i++)path.push_back(matrix[i][col-num-1]);if(2*num+2<= col && 2*num+2 <= row)for(int i = col-2-num; i >= num; i--)path.push_back(matrix[row-1-num][i]);if( 2*num+3 <= row && 2*num+2 <= col)for(int i = row-2-num; i >= num+1; i--)path.push_back(matrix[i][num]);}vector<int> spiralOrder(vector<vector<int> > &matrix) {        // Start typing your C/C++ solution below        // DO NOT write int main() function        vector<int> path;        int row = matrix.size();        if(row<1)return path;        int col = matrix[0].size();for(int i = 0; i< (row+1)/2 && i < (col+1)/2; ++i)printacircle(matrix, path, i);    }