--- title: Zig-zag matrix id: 594810f028c0303b75339ad8 challengeType: 5 videoUrl: '' localeTitle: 之字形矩阵 --- ## Description “zig-zag”数组是第一个$ N ^ 2 $整数的正方形排列,当数组沿着数组的反对角线曲折时,数字会逐渐增加。例如,给定“'5”',产生这个数组: 0 1 5 6 14 2 4 7 13 15 3 8 12 16 21 9 11 17 20 22 10 18 19 23 24 编写一个采用Z字形矩阵大小的函数,并将相应的矩阵作为二维数组返回。 ## Instructions ## Tests ```yml tests: - text: ZigZagMatrix必须是一个功能 testString: 'assert.equal(typeof ZigZagMatrix, "function", "ZigZagMatrix must be a function");' - text: ZigZagMatrix应该返回数组 testString: 'assert.equal(typeof ZigZagMatrix(1), "object", "ZigZagMatrix should return array");' - text: ZigZagMatrix应该返回一个nestes数组的数组 testString: 'assert.equal(typeof ZigZagMatrix(1)[0], "object", "ZigZagMatrix should return an array of nestes arrays");' - text: 'ZigZagMatrix(1)应返回[[0]]' testString: 'assert.deepEqual(ZigZagMatrix(1), zm1, "ZigZagMatrix(1) should return [[0]]");' - text: 'ZigZagMatrix(2)应返回[[0,1],[2,3]]' testString: 'assert.deepEqual(ZigZagMatrix(2), zm2, "ZigZagMatrix(2) should return [[0, 1], [2, 3]]");' - text: ZigZagMatrix(5)必须返回指定的矩阵 testString: 'assert.deepEqual(ZigZagMatrix(5), zm5, "ZigZagMatrix(5) must return specified matrix");' ``` ## Challenge Seed ```js function ZigZagMatrix(n) { // Good luck! return [[], []]; } ``` ### After Test ```js console.info('after the test'); ``` ## Solution ```js // solution required ```
0 1 5 6 14 2 4 7 13 15 3 8 12 16 21 9 11 17 20 22 10 18 19 23 24