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]
Soluzione
Grazie per i tuoi commenti!
single
Chieda ad AI
Chieda ad AI
Chieda pure quello che desidera o provi una delle domande suggerite per iniziare la nostra conversazione
Awesome!
Completion rate improved to 7.69Problem B
Scorri per mostrare il menu
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]
Soluzione
Cambia al desktop per esercitarti nel mondo realeContinua da dove ti trovi utilizzando una delle opzioni seguentiGrazie per i tuoi commenti!
single
