#include <stdio.h>
#include <stdlib.h>
int main()
{
int num1[] = { 1, 2, 3, 4};
int num2[] = { 5,6,7,8};
int i = 0;
for (i = 0; i < sizeof(num1)/sizeof(num1[0]); i++) //sizeof(num1)/sizeof(num1[0])求数组的元素个数
{
int j = 0;
for (j = 0; j < sizeof(num2)/sizeof(num2[0]); j++)
{
if (num1[i] == num2[j])
{
printf("有\n");
break;
}
}
if (num1[i] == num2[j])
break;
}
if (i == sizeof(num1)/sizeof(num1[0]))
printf("没有\n");
system("pause");
return 0;
}
方法2.
#include <stdio.h>
#include <stdlib.h>
int main()
{
int num1[] = { 1, 2, 3, 4};
int num2[] = { 3 ,4, 5, 6, 7};
int i = 0;
int count = 0;
for (i = 0; i < sizeof(num1) / sizeof(num1[0]); i++)
{
int j = 0;
for (j = 0; j < sizeof(num2) / sizeof(num2[0]); j++)
{
if (num1[i] == num2[j])
{
count++;
break;
}
}
if (count != 0)
{
break;
}
}
if (count == 0)
{
printf("没有\n");
}
else if (count > 0)
{
printf("有\n");
}
system("pause");
return 0;
}