一、题目地址
https://leetcode-cn.com/problems/da-yin-cong-1dao-zui-da-de-nwei-shu-lcof/
二、具体代码
1、未考虑大数问题
/**
* @param {number} n
* @return {number[]}
*/
var printNumbers = function(n) {
let end = Math.pow(10, n) - 1;
let res = [];
for(let i=0; i<end; i++) {
res[i] = i + 1;
}
return res;
};
2、考虑大数问题
/**
* @param {number} n
* @return {number[]}
*/
// 具体做法:递归生成全排列
// 时间复杂度:O(10^n)
// 空间复杂度:O(10^n)
let result;
let num;
let loop = ['0','1', '2', '3', '4', '5', '6', '7', '8', '9'];
let nine = 0;
let count = 0;
let m, start;
var printNumbers = function(n) {
m = n; //将n赋值给全局变量m
result = [];
num = [];
start = m - 1;
dfs(0);
// result = result.join('').substring(0, result.length - 1).split(',');
return result;
};
function dfs(x) {
if(x === m) {
let newNum = num.join('').substring(start);
console.log(newNum);
if(newNum !== '0') {
result[count++] = parseInt(newNum);
}
if(m - start === nine) {
start--;
}
return;
}
for(let loopNum of loop) {
if(loopNum === '9') {
nine++;
}
num[x] = loopNum;
dfs(x + 1);
}
nine--;
}
//console.log(parseInt('9,')) //9