Leetcode 59. 螺旋矩阵 II（DAY 216）---- 后端面试题

---

原题题目

---

---

代码实现（首刷自解）

---

class Solution {
public:
    vector<vector<int>> generateMatrix(int n) {
        vector<vector<int>> ret(n,vector<int>(n,0));
        int num = 1,max_num = n*n;
        int left = 0,right = n-1,upper = 0,bottom = n-1;

        while(num <= max_num)
        {
            for(int line = left;line <= right;++line)
                ret[upper][line] = num++;
            if(num > max_num)   break;

            for(int row = upper + 1;row <= bottom;++row)
                ret[row][right] = num++;
            
            for(int line = right- 1;line >= left;--line)
                ret[bottom][line] = num++;
            
            for(int row = bottom - 1;row > upper;--row)
                ret[row][left] = num++;
            
            ++left;--right;
            ++upper;--bottom;
        }

        return ret;
    }
};

---

代码实现（二刷自解 DAY 15 golang）

---

func generateMatrix(n int) [][]int {
  ret := make([][]int, n)
  for index := range ret {
    ret[index] = make([]int, n)
  }

  now, end := 1, n*n + 1
  left, right, up, down := 0, len(ret[0]) - 1, 0, len(ret) - 1
  for {
    for i := left; i <= right; i++ {
      ret[up][i] = now
      now++
    }
    if now == end {
      break
    }

    for i := up + 1; i <= down; i++ {
      ret[i][right] = now
      now++
    }
    if now == end {
      break
    }

    for i := right - 1; i >= left; i-- {
      ret[down][i] = now
      now++
    }
    if now == end {
      break
    }

    for i := down - 1; i >= up + 1; i-- {
      ret[i][left] = now
      now++
    }
    if now == end {
      break
    }

    up, down = up + 1, down - 1
    left, right = left + 1, right - 1
  }
  return ret
}