In this guide, you will get 2191. Sort the Jumbled Numbers LeetCode Solution with the best time and space complexity. The solution to Sort the Jumbled Numbers problem is provided in various programming languages like C++, Java, and Python. This will be helpful for you if you are preparing for placements, hackathons, interviews, or practice purposes. The solutions provided here are very easy to follow and include detailed explanations.
You are given a 0-indexed integer array mapping which represents the mapping rule of a shuffled decimal system. mapping[i] = j means digit i should be mapped to digit j in this system.
The mapped value of an integer is the new integer obtained by replacing each occurrence of digit i in the integer with mapping[i] for all 0 <= i <= 9.
You are also given another integer array nums. Return the array nums sorted in non-decreasing order based on the mapped values of its elements.
Notes:
Elements with the same mapped values should appear in the same relative order as in the input.
The elements of nums should only be sorted based on their mapped values and not be replaced by them.
Example 1:
Input: mapping = [8,9,4,0,2,1,3,5,7,6], nums = [991,338,38]
Output: [338,38,991]
Explanation:
Map the number 991 as follows:
1. mapping[9] = 6, so all occurrences of the digit 9 will become 6.
2. mapping[1] = 9, so all occurrences of the digit 1 will become 9.
Therefore, the mapped value of 991 is 669.
338 maps to 007, or 7 after removing the leading zeros.
38 maps to 07, which is also 7 after removing leading zeros.
Since 338 and 38 share the same mapped value, they should remain in the same relative order, so 338 comes before 38.
Thus, the sorted array is [338,38,991].
Input: mapping = [0,1,2,3,4,5,6,7,8,9], nums = [789,456,123]
Output: [123,456,789]
Explanation: 789 maps to 789, 456 maps to 456, and 123 maps to 123. Thus, the sorted array is [123,456,789].
Constraints:
mapping.length == 10
0 <= mapping[i] <= 9
All the values of mapping[i] are unique.
1 <= nums.length <= 3 * 104
0 <= nums[i] < 109
Complexity Analysis
Time Complexity: O(\texttt{sort})
Space Complexity: O(n)
2191. Sort the Jumbled Numbers LeetCode Solution in C++
class Solution {
public:
vector<int> sortJumbled(vector<int>& mapping, vector<int>& nums) {
vector<int> ans;
vector<tuple<int, int, int>> A; // (mapped, index, num)
for (int i = 0; i < nums.size(); ++i)
A.emplace_back(getMapped(nums[i], mapping), i, nums[i]);
ranges::sort(A);
for (const auto& [_, i, num] : A)
ans.push_back(num);
return ans;
}
private:
int getMapped(int num, const vector<int>& mapping) {
string mapped;
for (const char c : to_string(num))
mapped += to_string(mapping[c - '0']);
return stoi(mapped);
}
}; /* code provided by PROGIEZ */
2191. Sort the Jumbled Numbers LeetCode Solution in Java
class Solution {
public int[] sortJumbled(int[] mapping, int[] nums) {
int[] ans = new int[nums.length];
List<int[]> A = new ArrayList<>(); // (mapped, index, num)
for (int i = 0; i < nums.length; ++i)
A.add(new int[] {getMapped(nums[i], mapping), i, nums[i]});
Collections.sort(
A, (a, b) -> a[0] == b[0] ? Integer.compare(a[1], b[1]) : Integer.compare(a[0], b[0]));
return A.stream().mapToInt(a -> a[2]).toArray();
}
private int getMapped(int num, int[] mapping) {
StringBuilder sb = new StringBuilder();
for (final char c : String.valueOf(num).toCharArray())
sb.append(mapping[c - '0']);
return Integer.parseInt(sb.toString());
}
} // code provided by PROGIEZ
2191. Sort the Jumbled Numbers LeetCode Solution in Python
class Solution:
def sortJumbled(self, mapping: list[int], nums: list[int]) -> list[int]:
def getMapped(num: int) -> int:
mapped = []
for c in str(num):
mapped.append(str(mapping[int(c)]))
return int(''.join(mapped))
A = [(getMapped(num), i, num) for i, num in enumerate(nums)]
return [num for _, i, num in sorted(A)] # code by PROGIEZ
