LeetCode Spiral Matrix

class Solution {
public:
    vector<int> spiralOrder(vector<vector<int> > &matrix) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        int m,n;
        int cir;
        int i,j;
        vector<int> re;
        if(matrix.size()==)
            return re;

        m=matrix.size();
        n=matrix[].size();

        cir=min(m,n);
        cir=(cir+)/;
        for(i=;i<cir;i++)
        {
            for(j=i;j<i+n-(i)*;j++)
                re.push_back(matrix[i][j]);

            for(j=i+;j<i++m-(i+)*;j++)
                re.push_back(matrix[j][i+n-(i)*-]);

            if(i++m-(i+)*!=i)
            for(j=i+n-(i)*-;j>=i;j--)
                re.push_back(matrix[i++m-(i+)*][j]);

            if(i+n-(i)*-!=i)
            for(j=i++m-(i+)*-;j>i;j--)
                re.push_back(matrix[j][i]);
        }
        return re;

    }
};