class Solution { public: vector
relativeSortArray(vector& arr1, vector& arr2) { int cur = 0; for(int i = 0; i < arr2.size(); i++) { // arr2[i] for(int j = cur; j < arr1.size(); j++) { if(arr1[j] == arr2[i]) { swap(arr1[cur],arr1[j]); cur += 1; } } } if(cur < arr1.size()) { int left = cur; int right = arr1.size() - 1; quicksort(arr1, left, right); } return arr1; } void quicksort(vector& arr1, int left, int right) { if(left>=right) return; int start = left; int end = right; int pivot = arr1[left]; while(left < right) { while(arr1[right]>=pivot && left
