有序链表的合并（递归&非递归）

/* ============================================================================ Name : linkListTest.c Author : Version : Copyright : Your copyright notice Description : Hello World in C, Ansi-style ============================================================================ */#include <stdio.h>#include <stdlib.h>typedef struct Node Node;struct Node {int data;Node* next;};/* * 已知两个链表head1 和head2 各自有序， * 请把它们合并成一个链表依然有序， * 这次要求用递归方法进行 。 */Node* MergeRecursive(Node *head1, Node *head2) {if (head1 == NULL)return head2;if (head2 == NULL)return head1;Node *head = NULL;if (head1->data < head2->data) {head = head1;head->next = MergeRecursive(head1->next, head2);} else {head = head2;head->next = MergeRecursive(head1, head2->next);}return head;}int main(void) {puts("!!!Hello World!!!"); /* prints !!!Hello World!!! */return EXIT_SUCCESS;}

Node* Merge(Node *head1, Node *head2) {//第一个链表空，返回第二个链表if (head1 == NULL) {return head2;}//otherwiseif (head2 == NULL) {return head1;}Node *head = NULL;Node *p1 = NULL;Node *p2 = NULL;//确定head指向哪个链表//第二个小if (head1->data > head2->data) {head = head2;p2 = head2->next;//2移动p1 = head1;//1不动} else {head = head1;p1 = head1->next;p2 = head2;}Node *pcurrent = head;while (p1 != NULL && p2 != NULL) {if (p1->data <= p2->data) {pcurrent->next = p1;pcurrent = p1;p1 = p1->next;} else {pcurrent->next = p2;pcurrent = p2;p2 = p2->next;}if (p1 != NULL) {pcurrent->next = p1;}}if (p2 != NULL) {pcurrent->next = p2;}//确定head以后定义的pcurrent组成链表return head;}