text 给出数字n的JavaScript递归示例将自身乘以n + 1，直到在后续nu中找到0-9之间的所有数字

Posted 2021-05-02

let number = 0;
let numberArray = [0, 1, 2, 3, 4, 5, 6, 7, 8, 9];
let increment = 1;

let finalNumber = findNumber(number, numberArray, increment, number);
console.log(finalNumber);

function findNumber(num, numArray, increment, originalNum) {
  if(num === 0) return "Not Applicable";
  
  let numberToChange = originalNum * increment;
  
  numberString = numberToChange + "";
  let numSplit = numberString.split("");
  for(let i = 0; i < numSplit.length; i++) {
    if(numArray.includes(parseInt(numSplit[i]))) {
      let index = numArray.indexOf(parseInt(numSplit[i]));
        numArray.splice(index, 1);
    }
  }
  
  return (numArray.length === 0) ? numberToChange : findNumber(num, numArray, increment + 1, originalNum);
  
}