从一个数组合并两个int数组，无需重复

问题描述：

我正在尝试将两个数组合并成一个不重复，但是我的代码无法正常工作.谁能建议解决此问题的方法?

I am trying to merge two arrays into one without duplication but my code does not work correctly. Can anyone suggest how to fix this problem?

void unify(int set_A[], int size_A, int set_B[], int size_B, int set_C[], int size_C)
{
  int i,j,count=0,indx=size_A;
  for(i=0;i<size_A;i++)
  {
    set_C[i]=set_A[i];
  }

  for(i=0;i<size_B;i++)
  {
    for(j=0;j<size_A;j++)
    {
      if (set_B[i]!=set_C[j])
        count++;
    }
    if (count==size_A){
      set_C[indx]=set_B[i];
      indx++;
    }
  }

}

示例:

a{3 7 13 8 11 1 4}
b{5 7 1 2 3}

a_b{3 7 13 8 11 1 4 5 0 0 0 0 0..}

答

可能已经过优化，或者至少变得很漂亮:

Could probably be optimized, or at least made pretty:

void unify(int set_A[], int size_A, int set_B[], int size_B, int set_C[], int size_C)
{
    int indexC, indexTemp;

    for(indexC = 0; indexC < size_A; indexC++)
        set_C[indexC] = set_A[indexC];

    for(int indexB = 0; indexB < size_B; indexB++)
    {
        for(indexTemp = 0; indexTemp < indexC; indexTemp++)
        {
            if(set_B[indexB] == set_C[indexTemp])
                break;
        }

        if(indexTemp == indexC)
            set_C[indexC++] = set_B[indexB];
    }
}

从一个数组合并两个int数组，无需重复

相关推荐