数字最大的环回findOne

function findLargestCircularNumber(num) {
  let numStr = num.toString();
  let maxNum = num;

  for (let i = 0; i < numStr.length; i++) {
    let currentNum = numStr[i];
    let remainingNums = numStr.slice(0, i) + numStr.slice(i + 1);
    let circularNums = permute(remainingNums);

    circularNums.forEach((circularNum) => {
      let combinedNum = parseInt(currentNum + circularNum);
      if (combinedNum > maxNum) {
        maxNum = combinedNum;
      }
    });
  }

  return maxNum;
}

function permute(nums) {
  if (nums.length <= 1) {
    return [nums];
  }

  let permutations = [];

  for (let i = 0; i < nums.length; i++) {
    let currentNum = nums[i];
    let remainingNums = nums.slice(0, i) + nums.slice(i + 1);
    let innerPermutations = permute(remainingNums);

    innerPermutations.forEach((permutation) => {
      permutations.push(currentNum + permutation);
    });
  }

  return permutations;
}

// 示例用法
let num = 123;
let largestCircularNumber = findLargestCircularNumber(num);
console.log(largestCircularNumber);