数据结构第二章习题

#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<stdlib.h>
#include<iostream>
#include<fstream>
#include<string.h>
typedef struct Student {
	int score;
}Student;
typedef struct LNode {
	Student data;
	struct LNode* next;
}LNode,*LinkList;
typedef struct DuLNode {
	Student data;
	struct DuLNode* next;
	struct DuLNode* prior;
}DuLNode,*DuLinkList;
void CreateList_L(LinkList& L,const char* x)
{
	LinkList rear;
	LinkList p;
	FILE* infile;
	infile = fopen(x, "r");
	L = (LinkList)malloc(sizeof(LNode));
	rear = L;
	while (!feof(infile))
	{
		p = (LinkList)malloc(sizeof(LNode));
		fscanf(infile, "%d\n", &p->data.score);
		rear->next = p;
		rear = p;
	}
	rear->next = NULL;
	fclose(infile);
}
void CreateList_D(DuLinkList& D, const char* x)
{
	DuLinkList p,r;
	FILE* infile;
	infile = fopen(x, "r");
	D = new DuLNode;
	D->next = D;
	D->prior = D;
	r = D;
	while (!feof(infile))
	{
		p = new DuLNode;
		fscanf(infile, "%d\n", &p->data.score);
		r->next=p;
		p->next = D;
		p->prior=r;
		r = p;
	}
	fclose(infile);
}
void Output(LinkList L)
{
	LinkList p;
	printf("-----------------------------------------\n");
	p = L->next;
	while (p){
		printf("%d\n", p->data);
		p = p->next;
	}
}
void Output_D(DuLinkList D)
{
	DuLinkList p;
	printf("-----------------------------------------\n");
	p = D->next;
	while (p!=D) {
		printf("%d\n", p->data.score);
		p = p->next;
	}
}
void MergeList(LinkList& La, LinkList& Lb, LinkList& Lc)
{
	LinkList pa, pb, pc,q;
	pa = La->next;
	pb = Lb->next;
	Lc = pc = La;
	while (pa && pb)
	{
		if (pa->data .score< pb->data.score)
		{
			pc->next = pa;
			pc = pa;
			pa = pa->next;
		}
		else if (pa->data.score > pb->data.score)
		{
			pc->next = pb;
			pc = pb;
			pb = pb->next;
		}
		else
		{
			pc->next = pa;
			pc = pa;
			pa = pa->next;
			q = pb->next;
			delete pb;
			pb = q;
		}
	}
	pc->next = pa ? pa : pb;
	delete Lb;
}
void Difference(LinkList& La, LinkList& Lb, int& n)
{
	LinkList pa, pb, pre,u;
	pa = La->next;
	pb = Lb->next;
	pre = La;
	while (pa && pb)
	{
		if (pa->data.score < pb->data.score)
		{
			n++;
			pre = pa;
			pa = pa->next;
		}
		else if (pa->data.score > pb->data.score)
			pb = pb->next;
		else
		{
			pre->next = pa->next;
			u = pa;
			pa = pa->next;
			delete u;
		}
	}
	while (pa)
	{
		n++;
		pa = pa->next;
	}
}
void Decompose(LinkList& A, LinkList& B, LinkList& C)
{
	LinkList r,p;
	B = A;
	B->next = NULL;
	C = new LNode;
	C->next = NULL;
	p = A->next;
	while (p != NULL)
	{
		r = p->next;
		if (p->data.score < 0)
		{
			p->next = B->next;
			B->next = p;
		}
		else
		{
			p->next = C->next;
			C->next = p;
		}
		p = r;
	}
}
void Inverse(LinkList& L)
{
	LinkList p,q;
	p = L->next;
	L->next = NULL;
	while (p != NULL)
	{
		q = p->next;
		p->next = L->next;
		L->next = p;
		p = q;
	}
}
void Exchange(DuLinkList D)
{
	int n,m,i,k,j=0;
	DuLinkList p, q;
	p = D->next;
	while (p != D)
	{
		p = p->next;
		++j;
	}
	printf("该表一共有%d个结点\n", j);
	printf("请输入你想交换第几个结点和其前驱结点：\n");
	scanf("%d", &n);
	q = D;
	p = D->next;
	for (i = 1; i < n; ++i)
	{
		p = p->next;
	}
	q = p->prior;
	q->prior->next = p;
	p->prior = q->prior;
	q->next = p->next;
	q->prior = p;
	p->next->prior = q;
	p->next = q;
}
void main()
{
	const char* x1 = "indata_1.txt";
	const char* x2 = "indata_2.txt";