leetCode59.螺旋矩阵

中等

思路：

1. 首先确定边界，top、right、bottom、left、
2. 然后开始遍历存值：

• top为0，开始从left到right存值，然后top+1
• right为n-1,开始从top到bottom存值，然后right-1
• bottom为n-1，开始从right到left存值，然后bottom-1
• left为0，开始从bottom到top存值，然后left+1
• 循环…

  let n = 5;
        var generateMatrix = function (n) {
            const matrix = new Array(n);
            for (let i = 0; i < n; i++) {
                //生成空的数组
                matrix[i] = new Array(n);
            }
            console.log(matrix);
            let num = 1;
            let left = 0, right = n - 1, top = 0, bottom = n - 1;
            while (num <= n * n) {
                for (let i = left; i <= right; i++) {
                    console.log('1*--', top, i, '=' + num);
                    matrix[top][i] = num
                    num++
                }
                top++;
                for (let i = top; i <= bottom; i++) {
                    console.log('2*--', i, right, '=' + num);
                    matrix[i][right] = num
                    num++;
                }
                right--;
                for (let i = right; i >= left; i--) {
                    console.log('3*--', bottom, i, '=' + num);
                    matrix[bottom][i] = num
                    num++;
                }
                bottom--;
                for (let i = bottom; i >= top; i--) {
                    console.log('4*--', i, left, '=' + num);
                    matrix[i][left] = num
                    num++;
                }
                left++;
                console.log(num, 'left =' + left, 'right =' + right, " top =" + top, "bottom =" + bottom);
            }
            // return matrix;
        };
        console.log(generateMatrix(n));