mirror of
https://gitlab.com/mfocko/LeetCode.git
synced 2024-11-14 01:49:41 +01:00
35 lines
849 B
Java
35 lines
849 B
Java
class Solution {
|
|
private class Jumble {
|
|
public int original;
|
|
public int mapped;
|
|
|
|
public Jumble(int[] mapping, int original) {
|
|
this.original = original;
|
|
map(mapping, original);
|
|
}
|
|
|
|
private void map(int[] mapping, int original) {
|
|
mapped = mapping[original % 10];
|
|
original /= 10;
|
|
|
|
for (int power = 10; original > 0; power *= 10, original /= 10) {
|
|
mapped += power * mapping[original % 10];
|
|
}
|
|
}
|
|
}
|
|
|
|
public int[] sortJumbled(int[] mapping, int[] nums) {
|
|
var jumbled = new Jumble[nums.length];
|
|
for (int i = 0; i < nums.length; ++i) {
|
|
jumbled[i] = new Jumble(mapping, nums[i]);
|
|
}
|
|
|
|
Arrays.sort(jumbled, Comparator.comparing(k -> ((Jumble) k).mapped));
|
|
|
|
for (int i = 0; i < nums.length; ++i) {
|
|
nums[i] = jumbled[i].original;
|
|
}
|
|
|
|
return nums;
|
|
}
|
|
}
|