企业网站如何维护,做机械设备网站,963中华室内设计网,一流的龙岗网站制作思路#xff1a;计数排序#xff0c;然后根据计数的数组序列重构数组#xff0c;针对多余的数组元素采取sort函数进行升序排列加在末尾即可。 #include iostream
#include vector
#include algorithmusing namespace std;class Solution {
public:v…
思路计数排序然后根据计数的数组序列重构数组针对多余的数组元素采取sort函数进行升序排列加在末尾即可。 #include iostream
#include vector
#include algorithmusing namespace std;class Solution {
public:vectorint relativeSortArray(vectorint arr1, vectorint arr2) {vectorint counter vectorint(arr2.size(), 0);vectorint none;vectorint result;for (int i 0; i arr1.size(); i){for (int j 0; j arr2.size(); j){if (arr1[i] arr2[j]) {counter[j];break;}else if (j arr2.size() - 1)none.push_back(arr1[i]);}}int sum;for (auto t : arr2){sum t;t sum - t;}for (int q 0; q counter.size(); q) {while (counter[q]--) {result.push_back(arr2[q]);}}sort(none.begin(), none.end());result.insert(result.end(), none.begin(), none.end());return result;}
};int main() {Solution s;vectorint arr1 {2,3,1,3,2,4,6,7,9,2,19};vectorint arr2 {2,1,4,3,9,6};// s.relativeSortArray(arr1, arr2);for (auto t : s.relativeSortArray(arr1, arr2))cout t ;return 0;
}
