合并两个集合元素：遵循集合元素不重复的原则，已经存在的元素不再插入

#include <iostream>
using namespace std;

const int INT_ZERO = 0;
const int INDEX_ZERO = 0;
const int INDEX_ONE = 1;

bool inBuf( int *array, int size, int key )
{
     if (NULL == array)
     {
              throw;
     }
     
     int i = INDEX_ZERO; 
     while (i<size && key != array[i])
     {
           ++i;
     }
     
     if (key == array[i])
     {
             return true;
     }
     
     else
     {
         return false;
     }
}

void display( int *array, int size )
{
     if (NULL == array)
     {
              throw;
     }
     
     for (int i=INDEX_ZERO; i<size; ++i)
     {
         cout << array[i] << " ";
     }
     
     cout << endl;
}

int main( void )
{
    const int BUF_SIZE = 128;
    
    int a[] = {1, 2, 3, 5, 7, 9};
    const int SIZE_A = sizeof (a) / sizeof (*a);
    
    int buf[BUF_SIZE] = {2, 4, 6, 8, 9};
    int lengthBuf = 5;
    
    display( buf, lengthBuf );
    
    for (int i=INDEX_ZERO; i<SIZE_A; ++i)
    {
        if (INT_ZERO != a[i] && !inBuf( buf, lengthBuf, a[i] ))
        {
                   buf[lengthBuf] = a[i];
                   ++lengthBuf;
        }
    }
    
    display( buf, lengthBuf );
    
 	system( "PAUSE" );
 	return EXIT_SUCCESS;
}

/*----------------------
2 4 6 8 9
2 4 6 8 9 1 3 5 7
请按任意键继续. . .
--------------------------*/