LeetCode OJ-- Spiral Matrix II

https://oj.leetcode.com/problems/spiral-matrix-ii/

螺旋矩阵，和题目一一样的思路，这个是产生n*n 矩阵。

#include <iostream>
#include <vector>
using namespace std;

class Solution {
public:
    vector<vector<int> > generateMatrix(int n)  {
        vector<vector<int> > ans;
        if(n == )
            return ans;
        if(n ==)
        {
            vector<int> ansPiece;
            ansPiece.push_back();
            ans.push_back(ansPiece);
            return ans;
        }
        ans.resize(n);
        for(int i = ;i<n;i++)
            ans[i].resize(n);

        int l1,l2,r2,p1;
        l1 = ;
        l2 = ;
        r2 = n - ;
        p1 = n -;

        int num = ;
        while()
        {
            int i;
            if(num>n*n)
                break;

            for(i = l2; i <= r2; i++)
            {
                ans[l1][i] = num;
                num++;
            }

            if(l1+>p1)
                break;
            for(i = l1+;i<= p1;i++)
            {
                ans[i][r2] = num;
                num++;
            }

            if(r2-<l2)
                break;
            for(i = r2-;i>=l2;i--)
            {
                ans[p1][i] = num;
                num++;
            }

            if(p1-<l1+)
                break;
            for(i = p1-;i>=l1+;i--)
            {
                ans[i][l2] = num;
                num++;
            }
            l1++;
            l2++;
            r2--;
            p1--;
        }
        return ans;
    }
};