求两个整型数组的异集，即A+B-(A与B的交集)

2930阅读　0评论2012-07-25　时间看来
分类：C/C++

点击(此处)折叠或打开

  1. /*求两个整型数组的异集，即A+B-(A与B的交集)。*/
  2. #include <iostream>
  3. using namespace std;

  5. int search_one(int num, int *b_set_p, int b_set_size);

  7. int
  8. main(int argc, char *argv[])
  9. {
  10.     int array_a[] = {2, 3, 4, 8, 23, 21, 68, 79, 9, 15, 19};
  11.     int array_b[] = {23, 68, 94, 74, 89, 70, 20, 15};
  12.     int array_a_size, array_b_size;
  13.     array_a_size = sizeof(array_a)/sizeof(int);
  14.     array_b_size = sizeof(array_b)/sizeof(int);

  16.     int i;
  17.     cout << "different at array_a:" << endl;
  18.     for(i = 0; i < array_a_size; i++){
  19.         if(!search_one(array_a[i], array_b, array_b_size)){
  20.             /*打印出该元素*/
  21.             cout << array_a[i] << " ";
  22.         }
  23.     }

  25.     cout << endl << "different at array_b:" << endl;
  26.     for(i = 0; i < array_b_size; i++){
  27.         if(!search_one(array_b[i], array_a, array_a_size)){
  28.             /*打印出该元素*/
  29.             cout << array_b[i] << " ";
  30.         }
  31.     }

  33.     cout << endl << "array_a and array_b have the same elements:" <<endl;
  34.     for(i = 0; i < array_a_size; i++){
  35.         if(search_one(array_a[i], array_b, array_b_size)){
  36.             /*打印出该元素*/
  37.             cout << array_a[i] << " ";
  38.         }
  39.     }
  40.     return 0;
  41. }

  43. /*在B集合里寻找一个元素，找到返回非零，否则返回零。*/
  44. int
  45. search_one(int num, int *b_set_p, int b_set_size)
  46. {
  47.     int i;
  48.     for(i = 0; i < b_set_size; i++){
  49.         if(num == *(b_set_p+i))
  50.             return 1;
  51.     }
  52.     return 0;
  53. }

上一篇：有符号数和无符号数的移位操作
下一篇：判定cards类型