const recursivePrint = (n) => {
if (n === 1) {
console.log('1');
return;
}
recursivePrint(n - 1);
let line = '';
for (let i = 0; i < n; i++) {
line += n + ' ';
}
console.log(line.trim());
}
// 测试递归算法
recursivePrint(7);
const iterativePrint = (n) => {
for (let i = 1; i <= n; i++) {
let line = '';
for (let j = 0; j < i; j++) {
line += i + ' ';
}
console.log(line.trim());
}
}
// 测试非递归算法
iterativePrint(7);