题解 | #整型数组合并#

#include<iostream>
#include<stack>
using namespace std;
int main()
{
    int len1,len2;
    while(cin>>len1)
    {
        //输入
        int arr1[len1];
        for(int i=0; i<len1; i++)
        {
            cin>>arr1[i];
        }
        cin>>len2;
        int arr2[len2];
        for(int i=0; i<len2; i++)
        {
            cin>>arr2[i];
        }
        //stack<int> st;
        //数组排序(maopao)
        for(int i=0; i<len1; i++)
        {
            for(int j=0; j<len1-i-1; j++)
            {
                if(arr1[j]>arr1[j+1])
                {
                    swap(arr1[j], arr1[j+1]);
                }
            }
        }
        for(int i=0; i<len2; i++)
        {
            for(int j=0; j<len2-i-1; j++)
            {
                if(arr2[j]>arr2[j+1])
                {
                    swap(arr2[j], arr2[j+1]);
                }
            }
        }
        int pos1=0,pos2=0;
        while(pos1<len1 || pos2<len2)
        {
            if(pos1 == len1)
            {
                if(arr2[pos2] !=arr2[pos2-1])
                {
                    cout<<arr2[pos2];
                }
                pos2 ++;
                continue;
            }
            if(pos2 == len2)
            {
                if(arr1[pos1] !=arr1[pos1-1])
                {
                    cout<<arr1[pos1];
                }
                pos1 ++;
                continue;
            }
            if(arr1[pos1] < arr2[pos2])
            {
                if(arr1[pos1] !=arr1[pos1-1])
                {
                    cout<<arr1[pos1];
                }
                pos1 ++;
            }
            else if(arr1[pos1] > arr2[pos2])
            {
                if(arr2[pos2] !=arr2[pos2-1])
                {
                    cout<<arr2[pos2];
                }
                pos2 ++;
            }
            else if(arr1[pos1] == arr2[pos2])
            {
                if(arr2[pos2] !=arr2[pos2-1])
                {
                    cout<<arr2[pos2];
                }
                pos2 ++;
                pos1 ++;
            }
        }
        cout<<endl;
    }
    return 0;
}