Relative Sort Array
Given two arrays arr1 and arr2, the elements of arr2 are distinct, and all elements in arr2 are also in arr1.
Sort the elements of arr1 such that the relative ordering of items in arr1 are the same as in arr2. Elements that don't appear in arr2 should be placed at the end of arr1 in ascending order.
Example 1:
Input: arr1 = [2,3,1,3,2,4,6,7,9,2,19], arr2 = [2,1,4,3,9,6] Output: [2,2,2,1,4,3,3,9,6,7,19]
Constraints:
arr1.length, arr2.length <= 10000 <= arr1[i], arr2[i] <= 1000- Each
arr2[i]is distinct. - Each
arr2[i]is inarr1.
Remember
- sorting an array of numbers doesnt do what you expect
- for in deconstructing returns index then arg
- rember to use entries
- for in only objects
Solution
var relativeSortArray = function (arr1, arr2) {
let hash = {}
for (let [i, num] of arr2.entries()) {
hash[num] = i
}
for (let [i, num] of arr1.entries()) {
if (!(num in hash)) hash[num] = i + 1000
}
return arr1.sort((a, b) => hash[a] - hash[b])
};
comments powered by Disqus