Contenu du cours
Sorting Algorithms
Sorting Algorithms
Problem B
Swipe to start coding
Given two arrays arr1 and arr2, both consist of the same set of elements, but in arr1 they are distinct, meanwhile in arr2 are not. Sort the elements of arr2 such that the order of items in arr2 is the same as in arr1. All elements are non-negative.
Example 1
Input: arr1 = [3, 1, 2, 7, 5], arr2 = [2, 1, 1, 7, 3, 5, 7, 2, 1]
Output: [3, 1, 1, 1, 2, 2, 7, 7, 5]
Example 2
Input: arr1 = [0, 1, 3, 2], arr2 = [2, 0, 1, 3]
Output: [0, 1, 3, 2]
Solution
Passez à un bureau pour une pratique réelleContinuez d'où vous êtes en utilisant l'une des options ci-dessousMerci pour vos commentaires !
Problem B
Swipe to start coding
Given two arrays arr1 and arr2, both consist of the same set of elements, but in arr1 they are distinct, meanwhile in arr2 are not. Sort the elements of arr2 such that the order of items in arr2 is the same as in arr1. All elements are non-negative.
Example 1
Input: arr1 = [3, 1, 2, 7, 5], arr2 = [2, 1, 1, 7, 3, 5, 7, 2, 1]
Output: [3, 1, 1, 1, 2, 2, 7, 7, 5]
Example 2
Input: arr1 = [0, 1, 3, 2], arr2 = [2, 0, 1, 3]
Output: [0, 1, 3, 2]
Solution
Passez à un bureau pour une pratique réelleContinuez d'où vous êtes en utilisant l'une des options ci-dessousMerci pour vos commentaires !
Passez à un bureau pour une pratique réelleContinuez d'où vous êtes en utilisant l'une des options ci-dessous