利用尾指针连接两个单链表

备注：运行平台visual stdio,若为其他平台，需要将scanf_s()改为scanf()。

#include<stdio.h>
#include<stdlib.h>

#define  OK 1
#define ERROR 0
#define TRUE 1
#define FALSE 0
#define INFEASIBLE -1
#define OVERFLOW -2

typedef int ElemType;
typedef int Status;
typedef struct LNode {
	ElemType data;
	struct LNode *next;
}Node;

//创建循环链表
//输出参数：尾指针
Node * Creat()
{
	Node *head = NULL, *p = NULL, *q = NULL,*rear = NULL;
	ElemType temp=0;
	int i = 1;
	head = (Node *)malloc(sizeof(Node));
	p = head;
	while (TRUE)
	{
		printf("请输入第%d个数据：",i++);
		scanf_s("%d", &temp);
		if (temp == 0) break;//输入数据0表示输入结束。
		q = (Node *)malloc(sizeof(Node));
		q->data = temp;
		p->next = q;
		p = q;
	}
	q->next = head;
	rear = p;	
	return rear;
}


//遍历检验
//输入参数：尾指针
Status Traverse(Node *rear)
{
	Node *p = rear->next->next;
	int i = 1;
	while (TRUE)
	{
		printf("第%d个数据是%d\n", i++, p->data);
		p = p->next;
		if (p == rear->next) break;
	}
	return OK;
}


//连接两个链表
//输入参数：两个链表的尾指针。
Node * Connect(Node *rear1, Node *rear2)
{
	Node *temp = rear1->next;
	//直接先连接再说
	rear1->next = rear2->next->next;
	free(rear2->next);
	rear2->next = temp;
	return rear2;
}

int main() {
	Node *rear1 = Creat();
	Node *rear2 = Creat();
	Traverse(rear1);
	Traverse(rear2);
	Connect(rear1, rear2);
	Traverse(rear2);
	return 0;
}