宝典练习2之求两个数组的交集

#include "stdafx.h"
#include <iostream>
using namespace std;

int mixed(int *a, int *b, int length1, int length2, int *mix)
{
if (a == NULL || b == NULL || length1 == 0 || length2 == 0)
{
return -1;
}
int i = 0, j = 0;
int count = 0;
while (i < length1 && j < length2)
{
if (a[i] == b[j])
{
mix[count++] = a[i];
i++;
j++;
}
else
if (a[i] < a[j])
{
i++;
}
else
j++;
}
return count;
}
int _tmain(int argc, _TCHAR* argv[])
{
int a[] = {1,3,5,7,9};
int b[] = {2,4,5,7,10,12};
int *mix = new int[sizeof(a)/sizeof(a[0])];
int count = mixed(a, b, sizeof(a)/sizeof(a[0]), sizeof(b)/sizeof(b[0]), mix);
for (int i = 0; i < count; i++)
{
cout << mix[i] << ' ';
}
cout << endl;
system("pause");
return 0;
}