题解 | #蛇形矩阵#
蛇形矩阵
https://www.nowcoder.com/practice/649b210ef44446e3b1cd1be6fa4cab5e
动态规划来解矩阵题 完整代码如下：
const rl = require("readline").createInterface({ input: process.stdin });
var iter = rl[Symbol.asyncIterator]();
const readline = async () => (await iter.next()).value;
void async function () {
// Write your code here
while(line = await readline()){
let n = parseInt(line);
let res = Array(n).fill([]).map(() => new Array);
res[0][0] = 1;
for (let i = 0; i < n; i++) {
for (let j = 0; j < n-i; j++) {
if (i > 0) {
res[i][0] = res[i-1][0] + i
}
if (j > 0) {
res[i][j] = res[i][j-1] + j + i + 1
}
}
}
res.forEach(x => console.log(x.join(' ')));
}
}()
查看8道真题和解析
