leetcode59

class Solution {
public:
    vector<vector<int>> generateMatrix(int n) {
        int count = 0;
        int c1 = 0;
        vector<vector<int>>ans(n,vector<int>(n));
        if(!n) return ans;
        while(count<n*n)
        {
            //up
            for(int i = c1;i<n-c1;i++)
            {
                ans[c1][i] = ++count;
                if(count == n*n) return ans;
            }
            //right
            for(int j = c1+1;j<n-c1-1;j++)
            {
                ans[j][n-c1-1] = ++count;
                if(count == n*n) return ans;
            }
            //bottom
            for(int i = n-c1-1;i>=c1;i--)
            {
                ans[n-c1-1][i] = ++count;
                if(count == n*n) return ans;
            }
            // return ans;
            //left
            for(int j = n-c1-2;j>=c1+1;j--)
            {
                ans[j][c1] = ++count;
                if(count == n*n) return ans;
            }
            c1++;
        }
        return ans;
    }
};