Leetcode 1881. Maximum Value after Insertion

Given a string-represented integer n (possibly negative) and a digit x, insert x anywhere (not before a '-') to maximize the numeric value. This is a greedy scan: for positive n insert x before the first digit < x, for negative n insert x after '-' before the first digit > x, returning the resulting string.