假设有两个由小到大有序的有序顺序表A和B,现要求将表A和表B并入表C中,且表C仍保持由小到大的有序性。若合并后的顺序表表长超过总容量20,则输出“not enough”。
输入格式:
第一行为一个数字n,表示下面有n组数据,每组数据包括4行;每组数据中的第一行表示表A的表长,第二行表示表A的数据元素,第三行表示表B的表长,第四行表示表B的数据元素。
输出格式:
若合并成功,输出两行信息,第一行表示合并后表C的表长,第二行表示合并后表C的数据元素,每两个元素之间用一个空格分隔;若合并后的顺序表表长超过总容量20,则输出“not enough”。
输入样例:
在这里给出一组输入。例
1
4
1 3 8 17
3
6 10 15
如:
7
1 3 6 8 10 15 17
这边给出答案
#include<stdlib.h>
#include<stdio.h>
int main(){
typedef struct Node{
int data;
struct Node* next;
}Node;
int trash;
scanf("%d",&trash);
int n1,n2;
int x;
int c = 1;
while(c <=trash){
Node *head1 = (Node*)malloc(sizeof(Node));
Node *head2 = (Node*)malloc(sizeof(Node));
head1->next = NULL;
head2->next = NULL;
Node *current1 = head1;
scanf("%d",&n1);
for(int i = 0 ;i < n1 ;++i){
scanf("%d",&x);
Node *p1 = (Node*)malloc(sizeof(Node));
p1->data = x;
p1->next = NULL;
current1->next = p1;
current1 = p1;
}
Node *current2 = head2;
scanf("%d",&n2);
for(int i = 0 ;i < n2 ;++i){
scanf("%d",&x);
Node *p2 = (Node*)malloc(sizeof(Node));
p2->data = x;
p2->next = NULL;
current2->next = p2;
current2 = p2;
}
int n = n1+n2;
if(n > 20){
printf("not enough");
}
else{
Node* head3 = head1;
current1 = head1->next;
current2 = head2->next;
Node *current3 = head3;
while(current1&¤t2){
if(current1->data<=current2->data){
current3-> next= current1;
current3 = current1;
current1 = current1->next;
}
else{
current3->next = current2;
current3 = current2;
current2 = current2->next;
}
}
current3->next = current1?current1:current2;
free (head2);
current3 = head3;
printf("%d\n",n);
for(int i = 1 ;i < n ;++i){
current3 = current3->next;
printf("%d ",current3->data);
}
current3 = current3->next;
printf("%d\n",current3->data);
}
c++;
}
return 0;
}