題目描述
輸入
輸出
10 9 8 7 6 5 4 3 2 1
樣例輸入
4
7 9 10 11
4
8 12 13 14
樣例輸出
14 13 12 11 10 9 8 7
提示
代碼如下:#include <iostream>
#include <malloc.h>
using namespace std;
typedef struct LNode
{
int data;
struct LNode *next;
}LinkList;
void CreateListF(LinkList *&L,int a[],int n)
{
LinkList *s;
L=(LinkList *)malloc(sizeof(LinkList));
L->next=NULL;
for(int i=0;i<n;i++)
{
s=(LinkList *)malloc(sizeof(LinkList));
s->data=a[i];
s->next=L->next;
L->next=s;
}
}
void Commnnode(LinkList *LA,LinkList *LB,LinkList *&LC)
{
LinkList *pa=LA->next,*pb=LB->next,*r,*s;
LC=(LinkList *)malloc(sizeof(LinkList));
r=LC;
while (pa!=NULL&&pb!=NULL)
{
if (pa->data>pb->data)
{
s=(LinkList *)malloc(sizeof(LinkList));
s->data=pa->data;
r->next=s;
r=s;
pa=pa->next;
}
else
{
s=(LinkList *)malloc(sizeof(LinkList));
s->data=pb->data;
r->next=s;
r=s;
pb=pb->next;
}
}
while(pa!=NULL)
{
s=(LinkList *)malloc(sizeof(LinkList));
s->data=pa->data;
r->next=s;
r=s;
pa=pa->next;
}
while(pb!=NULL)
{
s=(LinkList *)malloc(sizeof(LinkList));
s->data=pb->data;
r->next=s;
r=s;
pb=pb->next;
}
r->next=NULL;
}
void ShowList(LinkList *L)
{
LinkList *p=L->next;
while(p != NULL)
{
cout << p->data << " ";
p = p->next;
}
cout << endl;
}
int main()
{
LinkList *s1,*s2;
int n,m,i;
int a[100],b[100];
cin>>n;
for (i=0;i<n;i++)
{
cin>>a[i];
}
cin>>m;
for (i=0;i<m;i++)
{
cin>>b[i];
}
CreateListF(s1,a,n);
CreateListF(s2,b,m);
LinkList *s3;
Commnnode(s1,s2,s3);
ShowList(s3);
return 0;
}