class Solution {
public:
    int getNum(vector<int>& nums) {
        int len = nums.size();
        int ret = 0;
        for (int i = 0, j = 1; i < len; i++) {
            ret += j * nums[i];
            j *= 10;
        }
        printf("%d\n", ret);
        return ret;
    }
    int minMaxDifference(int num) {
        vector<int> nums;
        int ans = num;
        while (num) {
            nums.push_back(num % 10);
            num /= 10;
        }
        int len = nums.size(), i = len - 1;
        while (i >= 0 && nums[i] == 9)
            i--;
        if (i == -1) return ans;
        int t = nums[i];
        vector<int> Max = nums;
        vector<int> Min = nums;
        while (i >= 0) {
            if (Max[i] == t) Max[i] = 9;
            i--;
        }
        len -= 1;
        t = nums[len];
        while (len >= 0) {
            if (Min[len] == t) Min[len] = 0;
            len--;
        }
        return getNum(Max) - getNum(Min);
    }
};