Leetcode 3079. Find the Sum of Encrypted Integers

Given an array of positive integers, for each number replace every digit with the largest digit present in that number (e.g., 523 -> 555) and return the sum of these transformed numbers. Constraints are small (n ≤ 50, nums[i] ≤ 1000), so a simple per-number digit scan suffices.