class Solution {

public:

    vector<int> spiralOrder(vector<vector<int> > &matrix) {

        vector<int> ans;

        int row = matrix.size();

        if(row == )

            return ans;

        if(row ==)

        {

            for(int i = ;i<matrix[].size();i++)

                ans.push_back(matrix[][i]);

            return ans;

        }

        int col = matrix[].size();

        int l1,l2,r2,p1;

        l1 = ;

        l2 = ;

        r2 = col - ;

        p1 = row -;

        while()

        {

            int i;

            if(l2>r2)

                break;

            for(i = l2; i <= r2; i++)

                ans.push_back(matrix[l1][i]);

            if(l1+>p1)

                break;

            for(i = l1+;i<= p1;i++)

                ans.push_back(matrix[i][r2]);

            if(r2-<l2)

                break;

            for(i = r2-;i>=l2;i--)

                ans.push_back(matrix[p1][i]);

            if(p1-<l1+)

                break;

            for(i = p1-;i>=l1+;i--)

                ans.push_back(matrix[i][l2]);

            l1++;

            l2++;

            r2--;

            p1--;

        }

        return ans;

    }

};