go语言题解LeetCode1122数组的相对排序

输入：arr1 = [2,3,1,3,2,4,6,7,9,2,19], arr2 = [2,1,4,3,9,6]
输出：[2,2,2,1,4,3,3,9,6,7,19]

输入：arr1 = [28,6,22,8,44,17], arr2 = [22,28,8,6]
输出：[22,28,8,6,17,44]

vector<int> relativeSortArray(vector<int>& arr1, vector<int>& arr2) {
        int tmp = 0;
        for(int i = 0;i<arr2.size();++i)
           for(int j = 0;j<arr1.size();++j){
               if(arr1[j] == arr2[i]){
                     swap(arr1[j],arr1[tmp]);
                     ++tmp;
               }
           }
           sort(arr1.begin()+tmp,arr1.end());
           return arr1;
    }

vector<int> relativeSortArray(vector<int>& arr1, vector<int>& arr2) 
{
	vector<int> count(1001);
	for (int i = 0; i<arr1.size(); i++)
	{
		count[arr1[i]]++;
	}
	int k = 0;
	for (int i = 0; i<arr2.size(); i++)
	{
		while (count[arr2[i]]>0)
		{
			arr1[k++] = arr2[i];
			count[arr2[i]]--;
		}
	}
	for (int i = 0; i < count.size(); i++)
	{
		while (count[i] >0)
		{
			arr1[k++] = i;
			count[i]--;
		}
	}
	return arr1;
}