//两个有序数组求交集(数组从大到小排序)
#include <iostream>
using namespace std;
int getInter(int *arr1, int n1, int *arr2, int n2, int *Inter)
{
int i = 0;
int j = 0;
int k = 0;
while(i < n1 && j < n2)
{
if(arr1[i] == arr2[j])
{ Inter[k++] = arr1[i] ; i++;j++;}
else if(arr1[i] < arr2[j])
{
i++;
}
else
j++;
}
if(k > 0)
return 1;
else
return 0;
}
void main()
{
int arr1[]={1,3,4,5,6};
int n1=sizeof(arr1)/sizeof(int);
int arr2[]={3,5,7,9};
本内容试读结束,登录后可阅读更多
下载后可阅读完整内容,剩余1页未读,立即下载