[leetcode]59. Spiral Matrix II

class Solution {
public:
    vector<vector<int>> generateMatrix(int n) 
    {
        vector<vector<int>> path(n,vector<int> (n,0));
        int l=0;
        int h=n-1;
        int sum=1;
        while(l<h)
        {
            for(int i=l;i<h;i++)
            {
                path[l][i]=sum;
                sum++;
            }
            for(int i=l;i<h;i++)
            {
                path[i][h]=sum;
                sum++;
            }
            for(int i=h;i>l;i--)
            {
                path[h][i]=sum;
                sum++;
            }
            for(int i=h;i>l;i--)
            {
                path[i][l]=sum;
                sum++;
            }
            
            l++;
            h--;
        }
        if(l==h)
        path[l][h]=n*n;
        return path;
    }
};