参考代码:
#include <bits/stdc++.h> using namespace std; struct Node { int data; Node *next; }; typedef Node* LinkList; int n; LinkList Create() { LinkList L,pre,p; L = new Node; L->next = NULL; pre = L; for(int i = 0; i < n; ++i) { p = new Node; cin >> p->data; p->next = NULL; pre->next = p, pre = p; } return L; } LinkList Union(LinkList A, LinkList B) { LinkList L,pre,p; L = new Node; L->next = NULL; pre = L; A = A->next, B = B->next; while(A && B) { p = new Node; p->next = NULL; if(A->data <= B->data) { p->data = A->data; A = A->next; } else if(A->data > B->data) { p->data = B->data; B = B->next; } pre->next = p, pre = p; } while(A) { p = new Node; p->data = A->data, p->next = NULL; pre->next = p, pre = p; A = A->next; } while(B) { p = new Node; p->data = B->data, p->next = NULL; pre->next = p, pre = p; B = B->next; } return L; } void Print(LinkList L) { L = L->next; int flag = 1; while(L) { if(flag) flag = 0, cout << L->data; else cout << ' ' << L->data; L = L->next; } cout << endl; } int main() { while(cin >> n) { LinkList A = Create(); cin >> n; LinkList B = Create(); LinkList C = Union(A, B); Print(C); } return 0; }
0.0分
5 人评分
C语言程序设计教程(第三版)课后习题6.7 (C语言代码)浏览:767 |
上车人数 (C语言代码)浏览:1192 |
C语言训练-计算1977!* (C语言代码)浏览:916 |
C语言训练-角谷猜想 (C++代码)(3N+1问题)浏览:1781 |
C语言程序设计教程(第三版)课后习题6.7 (C语言代码)浏览:651 |
简单的a+b (C语言代码)浏览:763 |
字符串问题 (C语言代码)浏览:1539 |
C语言程序设计教程(第三版)课后习题6.10 (C语言代码)浏览:572 |
sizeof的大作用 (C语言代码)浏览:1503 |
1124题解浏览:596 |