2566-maximum-difference-by-remapping-a-digit.js

/**
 * 2566. Maximum Difference by Remapping a Digit
 * https://leetcode.com/problems/maximum-difference-by-remapping-a-digit/
 * Difficulty: Easy
 *
 * You are given an integer num. You know that Bob will sneakily remap one of the 10 possible
 * digits (0 to 9) to another digit.
 *
 * Return the difference between the maximum and minimum values Bob can make by remapping
 * exactly one digit in num.
 *
 * Notes:
 * - When Bob remaps a digit d1 to another digit d2, Bob replaces all occurrences of d1 in
 *   num with d2.
 * - Bob can remap a digit to itself, in which case num does not change.
 * - Bob can remap different digits for obtaining minimum and maximum values respectively.
 * - The resulting number after remapping can contain leading zeroes.
 */

/**
 * @param {number} num
 * @return {number}
 */
var minMaxDifference = function(num) {
  const digits = String(num).split('');
  let maxNum = num;
  let minNum = num;

  for (let i = 0; i < 10; i++) {
    const digit = String(i);
    if (digits.includes(digit)) {
      const maxCandidate = Number(digits.join('').replaceAll(digit, '9'));
      const minCandidate = Number(digits.join('').replaceAll(digit, '0'));
      maxNum = Math.max(maxNum, maxCandidate);
      minNum = Math.min(minNum, minCandidate);
    }
  }

  return maxNum - minNum;
};