数据结构——链表合并.pdfVIP

I:\Experiment1_2\Main.c 1 #include stdio.h #include stdlib.h struct linknode { int data; struct linknode* link; }; typedef struct linknode LINKNODE; LINKNODE* SortedInput (); void RepeatDelete (LINKNODE*) ; void SortedOutput (LINKNODE*) ; void DestroyLinkList (LINKNODE*) ; LINKNODE* SortedUnion (LINKNODE*, LINKNODE*) ; int main() { LINKNODE* head1; LINKNODE* head2; LINKNODE* result ; printf (Input data in turn for linklist1 and put a 0 in the end:\n); head1 = SortedInput (); RepeatDelete (head1); printf (Input data in turn for linklist2:and put a 0 in the end\n); head2 = SortedInput (); RepeatDelete (head2); result = SortedUnion (head1, head2); printf (The result is:\n); SortedOutput (result); DestroyLinkList (head1); DestroyLinkList (head2); DestroyLinkList (result); return 0; } LINKNODE* SortedInput () {//按顺序依次读入数据 int temp; LINKNODE* head ; LINKNODE* tail; head = (LINKNODE*)malloc (sizeof(LINKNODE)); if (head NULL) { printf (Error: No enough memory available !\n); exit(1); } tail = head ; tail-link = NULL ; //创建头结点 scanf(%d, temp); while (temp != 0) { tail-link = (LINKNODE*)malloc (sizeof(LINKNODE)); if (tail-link NULL) I:\Experiment1_2\Main.c 2 { printf (Error: No enough memory available !\n); exit(1); } tail = tail-link; tail-data = temp; tail-link = NULL ; //依次在链表最后插入节点 scanf(%d, temp); } return head ; } void RepeatDelete (LINKNODE* head) {//删除元素按升序排列的链表中的重复元素 LINKNODE* current; LINKNODE* repeat ; current = head-link; while (current != NULL)