leetcode59+Spiral Matrix II

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

#include<iostream>
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<string>
#include<cstring>
#include<math.h>
#include<stack>
#include<queue>
#include<set>
#include<map>
#include<algorithm>
using namespace std;

class Solution {
public:
    vector<vector<int>> generateMatrix(int n) {
        int tot=1, i=0, j=0, Arr[n+5][n+5];
        vector<vector<int>> res;
        memset(Arr,0,sizeof(Arr));
        Arr[0][0]=tot, tot+=1;
        i=0,j=0;
        while (tot<=n*n) {
            while (j+1<n&&!Arr[i][j+1]) {
                j+=1;
                Arr[i][j]=tot;
                tot+=1;
            }
            while (i+1<n&&!Arr[i+1][j]) {
                i+=1;
                Arr[i][j]=tot;
                tot+=1;
            }
            while(j-1>=0&&!Arr[i][j-1]){
                j-=1;
                Arr[i][j]=tot;
                tot+=1;
            }
            while(i-1>=0&&!Arr[i-1][j]){
                i-=1;
                Arr[i][j]=tot;
                tot+=1;
            }
        }
        vector<int>temp;
        for(int i=0;i<n;i++){
            for(int j=0;j<n;j++){
                temp.push_back(Arr[i][j]);
            }
            res.push_back(temp);
            temp.clear();
        }
        return res;
    }
};