洗心革面重新开始

我决定从今天起洗心革面不再水了，从最基础的代码走起，打好底子。今天写了链表，上传到这里起个监督作用。希望坚持下去！加油

#include<iostream>
#include<stdio.h>
using namespace std;
#ifndef _List_H
struct Node;
typedef struct Node *PtrNode;
typedef PtrNode List;
typedef PtrNode Position;

List MakeEmpty(List L);
int IsEmpty(List L);
int IsLast(Position P,List L);
Position Find(int X,List L);
void Delete(int X,List L);
Position FindPrevious(int X,List L);
void Insert(int X,Position P,List L);
void DeleteList(List L);
void PrintList(List L);
#endif

struct Node{
	int Element;
	Position Next;
};

List MakeEmpty(List L)
{
L->Next=NULL;
return L;
}

int IsEmpty(List L)
{
return L->Next==NULL;
}

int IsLast(Position P,List L)
{
return P->Next==NULL;
}

Position Find(int X,List L)
{
Position P=L->Next;
while(P!=NULL&&P->Element!=X)
	P=P->Next;
return P;
}

Position FindPrevious(int X,List L)
{
Position P=L;
while(P->Next!=NULL&&P->Next->Element!=X)
	P=P->Next;
return P;
}

void Delete(int X,List L)
{
Position P=FindPrevious(X,L);
if(!IsLast(P,L))
{
Position Temp;
Temp=P->Next;
P->Next=Temp->Next;
free(Temp);
}
}

void Insert(int X,Position P,List L)
{
Position Temp;
Temp=(Position)malloc(sizeof(struct Node));
if(Temp==NULL)
{
	cout<<"out of space!";
	return;
}
Temp->Element=X;
Temp->Next=P->Next;
P->Next=Temp;
}

void DeleteList(List L)
{
Position P=L->Next;
Position Temp;
L->Next=NULL;
while(P!=NULL)
{
Temp=P->Next;
free(P);
P=Temp;
}
}

void PrintList(List L)
{
Position P=L->Next;
while(P!=NULL)
{
cout<<P->Element;
P=P->Next;
if(P!=NULL)
	cout<<"->";
}
cout<<endl;
}

int main()
{
List L=(List)malloc(sizeof(struct Node));
MakeEmpty(L);
Insert(1,L,L);
Position P=L->Next;
Insert(0,P,L);
PrintList(L);
Delete(1,L);
PrintList(L);
DeleteList(L);
system("pause");
}