[LeetCode] Spiral Matrix II

class Solution {
public:
    vector<vector<int> > generateMatrix(int n) {
        vector<int> v(n,0);
        vector<vector<int>> res(n,v);
        int col = (n+1)/2-1;//结束点的行列号
        int row = n/2;
        int num = 1;
        int rowStart=0,rowEnd=n-1,colStart=0,colEnd=n-1;

        int j=colStart,i=rowStart ;
        while(1)
        {
            
            for(j = colStart;j<=colEnd;j++)
            {
                res[i][j] = num++;
            }
            j = j-1;
            if(i==row && j==col)
                break;
            rowStart++;
            j = colEnd;

            for(i=rowStart;i<=rowEnd;i++)
            {
                res[i][j] = num++;
            }
            colEnd--;
            i = rowEnd;
            for(j=colEnd;j>=colStart;j--)
            {
                res[i][j] = num++;

            }
            j = j+1;
            if(i==row && j==col)
                break;
            rowEnd--;
            j=colStart;
            for(i = rowEnd;i>=rowStart;i--)
            {
                res[i][j] = num++;
            }
            colStart++;
            i = rowStart;
        }//end while
    return res;
    }
};