2566

2566. Maximum Difference by Remapping a Digit (Easy)

You are given an integer num. You know that Danny Mittal will sneakily remap one of the 10 possible digits (0 to 9) to another digit.

Return the difference between the maximum and minimum values Danny can make by remapping exactly one digit in num.

Notes:

• When Danny remaps a digit d1 to another digit d2, Danny replaces all occurrences of d1 in num with d2.
• Danny can remap a digit to itself, in which case num does not change.
• Danny can remap different digits for obtaining minimum and maximum values respectively.
• The resulting number after remapping can contain leading zeroes.
• We mentioned "Danny Mittal" to congratulate him on being in the top 10 in Weekly Contest 326.

 

Example 1:

Input: num = 11891
Output: 99009
Explanation: 
To achieve the maximum value, Danny can remap the digit 1 to the digit 9 to yield 99899.
To achieve the minimum value, Danny can remap the digit 1 to the digit 0, yielding 890.
The difference between these two numbers is 99009.

Example 2:

Input: num = 90
Output: 99
Explanation:
The maximum value that can be returned by the function is 99 (if 0 is replaced by 9) and the minimum value that can be returned by the function is 0 (if 9 is replaced by 0).
Thus, we return 99.

 

Constraints:

• 1 <= num <= 108

Related Topics:
Math, Greedy

Solution 1.

// OJ: https://leetcode.com/problems/maximum-difference-by-remapping-a-digit
// Author: github.com/lzl124631x
// Time: O(N)
// Space: O(N)
class Solution {
public:
    int minMaxDifference(int n) {
        auto s = to_string(n);
        char p = 0, q = s[0];
        string mx, mn;
        for (int i = 0; i < s.size(); ++i) {
            if (s[i] == '9') mx += s[i];
            else if (p == 0) {
                p = s[i];
                mx += '9';
            } else if (p == s[i]) mx += '9';
            else mx += s[i];
            if (s[i] == q) mn += '0';
            else mn += s[i];
        }
        return stoi(mx) - stoi(mn);
    }
};