实验11_9_链表归并

题目描述

已知有两个递增的正整数序列A和B，序列中元素个数未知，同一序列中不会有重复元素出现，有可能某个序列为空。现要求将序列B归并到序列A中，且归并后序列A的数据仍然按递增顺序排列。如果序列B中某些数据在序列A中也存在，则这些数据所在节点仍然留在序列B中，而不被归并到序列A中；否则这些数据所在节点将从序列B中删除，添加到序列A中。
要求：
建立两个单链表A、B用于存储两个正整数序列，然后按照题目的要求，将链表B中的元素归并到链表A中。在归并的过程中，不要释放B中的节点空间、然后建立新节点，而要改变指针的指向，使元素从B中删除并添加到A中。正整数序列按照递增顺序输入，用-1作为结束标志，注意-1不算这个正整数序列中的元素（不要统计-1）。在程序结束前要释放链表A、B中的所有节点。

输入

依次输入两个递增的正整数序列A和B，序列元素的个数未知，但以输入“-1”结束，每个正整数序列占一行。

输出

处理后的链表A中的元素，占一行；然后是处理后的链表B中的元素，占一行。每行的每个元素后有一个空格，注意最后一个元素后只有换行符，如果某个链表为空则，则输出“There is no item in X list.”
数据最多的测试用例节点数在100这个数量级，所有整数可以用int型存储。
请注意输入输出格式。

#include <stdio.h>
#include <stdlib.h>
typedef struct node{
	int data;
	struct node * nextPtr;
}LISTNODE, * LISTNODEPTR;
void createListHead(LISTNODEPTR *,LISTNODEPTR *);
void insertEnd(LISTNODEPTR *,int);
void mergeList(LISTNODEPTR,LISTNODEPTR);
int isEmpty(LISTNODEPTR);
void printList(LISTNODEPTR);
void destroyList(LISTNODEPTR);
int main(){
	LISTNODEPTR headPtrA,lastPtrA,headPtrB,lastPtrB;
	createListHead(&headPtrA,&lastPtrA);
	createListHead(&headPtrB,&lastPtrB);
	int value;
	scanf("%d",&value);
	while(value != -1){
		insertEnd(&lastPtrA,value);
		scanf("%d",&value);
	}
	scanf("%d",&value);
	while(value != -1){
		insertEnd(&lastPtrB,value);
		scanf("%d",&value);
	}
	if(isEmpty(headPtrA)&&isEmpty(headPtrB)){
		printf("There is no item in A list.\nThere is no item in B list.\n");
	}
	else if(isEmpty(headPtrB)){
		printf("The new list A:");
		printList(headPtrA);
		printf("There is no item in B list.\n");
	}
	else if(isEmpty(headPtrA)){
		printf("The new list A:");
		printList(headPtrB);
		printf("There is no item in B list.\n");
	}
	else{
		mergeList(headPtrA,headPtrB);
		if(isEmpty(headPtrB)){
			printf("The new list A:");
			printList(headPtrA);
			printf("There is no item in B list.\n");
		}
		else{
			printf("The new list A:");
			printList(headPtrA);
			printf("The new list B:");
			printList(headPtrB);
		}
		
	}
	destroyList(headPtrA);
	destroyList(headPtrB);
	return 0;
}
void createListHead(LISTNODEPTR * headPtrPtr,LISTNODEPTR * lastPtrPtr){
	(*headPtrPtr) = malloc(sizeof(LISTNODE));
	if((*headPtrPtr) != NULL){
		(*headPtrPtr)->nextPtr = NULL;
		(*lastPtrPtr) = (*headPtrPtr);
	}
	else{
		printf("Error!-101");
	}
}
void insertEnd(LISTNODEPTR * lastPtrPtr,int value){
	LISTNODEPTR newPtr = malloc(sizeof(LISTNODE));
    if(newPtr != NULL){
		newPtr->data = value;
		newPtr->nextPtr = NULL;
		(*lastPtrPtr)->nextPtr = newPtr;
		(*lastPtrPtr) = newPtr;
	}
	else{
		printf("Error!-102");
	}
}
void mergeList(LISTNODEPTR headPtrA,LISTNODEPTR headPtrB){
	LISTNODEPTR previousPtrA,currentPtrA,previousPtrB,currentPtrB;
	previousPtrA = headPtrA;
	currentPtrA = headPtrA->nextPtr;
	previousPtrB = headPtrB;
	currentPtrB = headPtrB->nextPtr;
	while((currentPtrA->nextPtr != NULL) && (currentPtrB->nextPtr != NULL)){
		while(currentPtrA->data<currentPtrB->data && currentPtrA->nextPtr != NULL){
			previousPtrA = previousPtrA->nextPtr;
			currentPtrA = currentPtrA->nextPtr;
		}//将A指针移动至可升序插入的位置
		while(currentPtrA->data > currentPtrB->data){
			LISTNODEPTR tempPtr1 = previousPtrA->nextPtr;
			previousPtrA->nextPtr = previousPtrB->nextPtr;
			previousPtrB->nextPtr = currentPtrB->nextPtr;
			currentPtrB->nextPtr = tempPtr1;
			currentPtrA = previousPtrA->nextPtr;
			currentPtrB = previousPtrB->nextPtr;
			//swap，直至B无可插入的为止;
		}
		while(currentPtrA->data == currentPtrB->data && currentPtrA->nextPtr != NULL && currentPtrB->nextPtr != NULL){
			previousPtrA = previousPtrA->nextPtr;
			currentPtrA = currentPtrA->nextPtr;
			previousPtrB = previousPtrB->nextPtr;
			currentPtrB = currentPtrB->nextPtr;
		}//如果相等，则全体往后移一位
	}
	while((currentPtrA->data<currentPtrB->data) && (currentPtrA->nextPtr != NULL)){
			previousPtrA = previousPtrA->nextPtr;
			currentPtrA = currentPtrA->nextPtr;
		}//解决B到头了而A未到头的情况
	while((currentPtrA->data>currentPtrB->data) && (currentPtrA->nextPtr == NULL) && (currentPtrB->nextPtr != NULL)){
			LISTNODEPTR tempPtr1 = previousPtrA->nextPtr;
			previousPtrA->nextPtr = previousPtrB->nextPtr;
			previousPtrB->nextPtr = currentPtrB->nextPtr;
			currentPtrB->nextPtr = tempPtr1;
			currentPtrA = previousPtrA->nextPtr;
			currentPtrB = previousPtrB->nextPtr;
			previousPtrA = previousPtrA->nextPtr;
			currentPtrA = currentPtrA->nextPtr;
		}//特殊情况：A最后一个，B不在最后一个，A的数大于B的数->循环，将B插入A中
	if((currentPtrA->data > currentPtrB->data) && (currentPtrB->nextPtr == NULL)){
			LISTNODEPTR tempPtr1 = previousPtrA->nextPtr;
			previousPtrA->nextPtr = previousPtrB->nextPtr;
			previousPtrB->nextPtr = currentPtrB->nextPtr;
			currentPtrB->nextPtr = tempPtr1;
			currentPtrA = previousPtrA->nextPtr;
			currentPtrB = previousPtrB->nextPtr;
	}//特殊情况：A的数大于B的数，B在最后一个->将B插入A中
	else if((currentPtrA->data < currentPtrB->data) && (currentPtrA->nextPtr == NULL) && (currentPtrB->nextPtr == NULL)){
		currentPtrA->nextPtr = previousPtrB->nextPtr;
		previousPtrB->nextPtr = NULL;
	}//特殊情况：A的数<B的数，A、B均在最后一个->B接入A后
	else{//将B后比A大的部分接到A后
		while(currentPtrB->data <= currentPtrA->data && currentPtrB->nextPtr != NULL){
			previousPtrB = previousPtrB->nextPtr;
			currentPtrB = currentPtrB->nextPtr;
		}
		if(previousPtrB->nextPtr != NULL && (currentPtrB->data)>(currentPtrA->data)){
			currentPtrA->nextPtr = previousPtrB->nextPtr;
			previousPtrB->nextPtr = NULL;
		}
	}
	
}
int isEmpty(LISTNODEPTR headPtr){
	if(headPtr->nextPtr == NULL){
		return 1;
	}
	return 0;
}
void printList(LISTNODEPTR headPtr){
	while(headPtr->nextPtr->nextPtr != NULL){
		headPtr = headPtr->nextPtr;
		printf("%d ",headPtr->data);
	}
	headPtr = headPtr->nextPtr;
	printf("%d\n",headPtr->data);
}
void destroyList(LISTNODEPTR headPtr){
	LISTNODEPTR tempPtr = headPtr;
	while(headPtr != NULL){
		headPtr = headPtr->nextPtr;
		free(tempPtr);
		tempPtr = headPtr;
	}
}