#include<iostream>
using namespace std;
{
int i=0,j=0,k=0;
while(i<m&&j<n)
{
if(a[i]>b[j])
j++;
else if(a[i]<b[j])
i++;
else
{
c[k]=a[i];
i++;
j++;
k++;
}
}
return k;
}
int main()
{
int a[]={1,3,5,6,7,8,9};
int b[]={2,3,4,5,6,7,8,9};
int length_a=sizeof(a)/sizeof(a[0]);
int length_b=sizeof(b)/sizeof(b[0]);
int length_c=length_a>length_b?length_a:length_b;
int *p=new int[length_c];
int result=mix(a,length_a,b,length_b,p);
if(result==0)
cout<<"两个数组的交集为空!!"<<endl;
else
{
for(int i=0;i<result;i++)
cout<<p[i]<<" ";
cout<<endl;
system("pause");
return 0;
using namespace std;
//采用二路归并法,查找两个数组的交集进行保存,并返回交集的个数。
int mix(int a[],int m,int b[],int n,int *c){
int i=0,j=0,k=0;
while(i<m&&j<n)
{
if(a[i]>b[j])
j++;
else if(a[i]<b[j])
i++;
else
{
c[k]=a[i];
i++;
j++;
k++;
}
}
return k;
}
int main()
{
int a[]={1,3,5,6,7,8,9};
int b[]={2,3,4,5,6,7,8,9};
int length_a=sizeof(a)/sizeof(a[0]);
int length_b=sizeof(b)/sizeof(b[0]);
int length_c=length_a>length_b?length_a:length_b;
int *p=new int[length_c];
int result=mix(a,length_a,b,length_b,p);
if(result==0)
cout<<"两个数组的交集为空!!"<<endl;
else
{
for(int i=0;i<result;i++)
cout<<p[i]<<" ";
cout<<endl;
}
delete p;
cout<<endl;system("pause");
return 0;
}
输出结果: