题解 | #整型数组合并#

#include <stdio.h>
#include <string.h>
#include <stdlib.h>
void sort(int *arr,int n){
    for(int i=0;i<n-1;i++)
        for(int j=i+1;j<n;j++)
        {
            if(arr[i]>arr[j])
            {
                int temp=arr[i];
                arr[i]=arr[j];
                arr[j]=temp;
            }
        }
}
int main()
{
  int n1, n2;
  while (scanf("%d", &n1) != EOF)
  {
    int s1[n1];
    for (int i = 0; i < n1; i++)
      scanf("%d", &s1[i]);
    scanf("%d", &n2);
    int s2[n2];
    for (int i = 0; i < n2; i++)
      scanf("%d", &s2[i]);
    int s[n1 + n2];
    int top = -1;
    int flag; 
    for (int i = 0; i < n1; i++)
    {
        flag = 0;
        for (int j = 0; j <= top; j++)
            if (s1[i] == s[j])
            {
                flag = 1;
                break;
            }
        if (flag == 0)
          s[++top] = s1[i];
    }
    for (int i = 0; i < n2; i++)
    {
      flag = 0;
      for (int j = 0; j <= top; j++)
      {
        if (s2[i] == s[j])
        {
          flag = 1;
          break;
        }
      }
      if (flag == 0)
        s[++top] = s2[i];
    }
    sort(s, top+1);
    for (int i = 0; i <= top; i++)
    {
      printf("%d", s[i]);
    }
  }
  return 0;
}