C++算法示例1

#include<vector>
using namespace std;

int main()
{
    int countMorning =11;
    int countEvening =10;
    int morningList[] = {1,1,2,3,4,5,5,7,6,9,10};
    int eveningList[]={11,12,14,4,5,6,7,18,19,20};
    int aa=perfectDancers(countMorning,countEvening,morningList,eveningList) ;
    cout<<aa;
    return 0;
}

int perfectDancers(int countMorning, int countEvening, int *morningList, int *eveningList)
{
    // WRITE YOUR CODE HERE
    std::vector<int>vec1,vec12;
    for(int i=0;i<countMorning;i++)
    {
        int k=0;
        for(int j=0;j<countEvening;j++)
        {
            if(morningList[i]==eveningList[j])
                k++;
        }
        if(k==0)
            vec1.push_back(morningList[i]);
    }
    for(int i=0;i<countEvening;i++)
    {
        int k=0;
        for(int j=0;j<countMorning;j++)
        {
            if(eveningList[i]==morningList[j])
                k++;
        }
      	if(k==0)
            vec2.push_back(eveningList[i]);
    }
    //拼接
    vec1.insert(vec1.end(),vec2.begin(),vec2.end());  
	// 显示
    for(int i=0;i<vec1.size();i++)
    {
        cout<<"mor_temp="<<vec1[i]<<endl;
    }
    return (int)vec1.size();
}