PTA实验11-2-5链表拼接

链表拼接

struct ListNode *mergelists(struct ListNode *list1, struct ListNode *list2) {
	struct ListNode *p1 = list1, *p2 = list2, *prev = NULL, *pcurrent = NULL, *head = NULL;//p1--1链表，p2--2链表, head记录list1的头节点
	if(p1==NULL) {
		head = p2;
	} else if(p2 == NULL) {
		head = p1;
	} else {
		//2链表的头结点所指的data小于1链表头结点所指的data
		if(p2->data<p1->data) { 
			/************
				2链表的头结点所指的data小于1链表时，将2链表
				头结点移到1链表头上
			************/
			pcurrent = p2;
			p2 = p2->next;
			pcurrent->next = p1;
			p1 = pcurrent;
			head = p1;
		}
		//2链表的头结点所指的data大于1链表头结点所指的data
		prev = p1;//用来指list1中当前节点 
		head = p1;
		while(p2!=NULL) {
			if(prev->next == NULL){//将list1节点判断的优先级放前面，防止后面代码运行中程序越界 
				prev->next = p2;
				break;
			}
			if(p2->data<=prev->next->data) {//*****注意用<=，若只用<则没法将list2中与list1相等的元素放进去 *****//
				pcurrent = p2;//pcurrent记录节点 
				p2 = p2->next;
				pcurrent->next = prev->next;
				prev->next = pcurrent;
				prev = pcurrent;//list1中节点往后移一个 
			} else {
				prev = prev->next;
			}
		}
	}
	return head;
}