PTA 有序链表的合并
题意：将两个非递减的链表合并，合并之后的链表仍为非递减的。代码：#include <iostream>using namespace std;struct Node { int data; Node *next;};typedef Node *List;void CreateList(List &L){ L = new Node; L->next = NULL; Node *tail = L; int
