Leetcode 738. Monotone Increasing Digits

Given n, return the largest integer ≤ n whose digits are nondecreasing left-to-right (each digit ≤ the next); the challenge is to transform n's digits to enforce this monotone property while maximizing the resulting value.