#include <stdio.h>
//找出2個數組相同的項，并将其儲存在另外一個數組中
int main()
{
int buf1[]={1,2,3};
int buf2[]={2,3,4};
int des[3];
int count=0;
for(int i=0;i<sizeof(buf1)/sizeof(int);i++) //周遊buf1
{
for(int j=0;j<sizeof(buf2)/sizeof(int);j++) //周遊buf2
{
if(buf1[i]==buf2[j]) //若相等則将其指派到des[],反之繼續
des[count++]=buf1[i];
//else continue;
}
}
printf("intersection between buf1[] and buf2[] are des[]:{"); //将des的值列印出來
for(int i=0;i<count;i++)
{
if(i==count-1)
printf("%d",des[i]);
else
printf("%d,",des[i]);
}
printf("} \n");
return 0;
}