【Leetcode】之Spiral Matrix II

一.问题描述

Given an integer n, generate a square matrix filled with elements from 1 to n2 in spiral order.

For example,
Given n = 3,

You should return the following matrix:

[
 [ 1, 2, 3 ],
 [ 8, 9, 4 ],
 [ 7, 6, 5 ]
]

二.我的解题思路

这道题和之前的spiral matrix I的解法差不多，这道题还要更容易些，直接采用递归的算法思想就能很好的解决本题。测试通过的程序如下：

class Solution {
public:
    vector<vector<int>> generateMatrix(int n) {
        vector<vector<int>> res;
        if(n==0) return res;
        vector<int> tmp(n,0);
        for(int i=0;i<n;i++)
            res.push_back(tmp);
        int curr=1;
        int row_st=0;int row_end=n-1;
        int line_st=0;int line_end=n-1;
        gen_res(res,curr,row_st,row_end,line_st,line_end);
        return res;
        
    }
    
    void  gen_res( vector<vector<int>> &res,int curr,int row_st,int row_end,int line_st,int line_end){
        if(row_st>row_end || line_st>line_end)
            return;
        if(row_st==row_end){
            res[row_st][line_st]=curr;
            return;
        }
         for(int i=line_st;i<=line_end;i++)
            {res[row_st][i]=curr;curr++;}
         for(int i=row_st+1;i<=row_end;i++)
            {res[i][line_end]=curr;curr++;}
         for(int i=line_end-1;i>line_st;i--)
            {res[row_end][i]=curr;curr++;}
         for(int i=row_end;i>row_st;i--)
            {res[i][line_st]=curr;curr++;}
      
    
        row_st++;line_st++;
        row_end--;line_end--;
        gen_res(res,curr,row_st,row_end,line_st,line_end);
    }
};