C++单链表相关操作的实现

[size=medium] 闲来无趣,把自己才写的数据结构试验贴上来,觉得还是很有成就很有用的~[/size]

#include<stdlib.h>
#include<stdio.h>
//定义结构体-节点
struct LNode
{
int data;
LNode* next;
};

typedef struct LNode *LinkList;
void CreateList_L(LinkList &L,int n);
int List_DeleteOne(LinkList &L,int n);
void VisitAll(LinkList L);
int InOrderVisitAll(LinkList L);
int List_InsertOne(LinkList &L,int n, int e);
LinkList getOneNode(LinkList &L,int n);
int getLength(LinkList &L);


//1.创建一个n个长度的链表
void CreateList_L(LinkList &L,int n)
{
LinkList p = NULL, q = NULL;
L = (LinkList)malloc(sizeof (LinkList));
L->next =NULL;
p = q = L;
for (int i = n; i > 0; --i)
{
p = (LinkList)malloc(sizeof (LinkList));
printf("Please input the data:");
scanf("%d",&p->data);
p->next = NULL;
q->next = p;
q = p;
}
}


//2.单链表在某结点之前插入一个新结点
int List_InsertOne(LinkList &L,int n, int e){
LinkList p=L;int j=0;
while(p&&j<n-1){p=p->next;++j;}
if(!p||j>n-1){return -1;}
LinkList s=(LinkList)malloc(sizeof(LNode));
s->data=e;s->next=p->next;
p->next=s;
return 0;}


//3.删除某位置上一个节点
int List_DeleteOne(LinkList &L,int n){
LinkList p=L;
LinkList q=L;
int j=0;
int len=getLength(p);
if(n>len||n<1){
return -1;
}
while(p&&j<n-1){
p=p->next;
++j;
}
q=p->next;
p->next=q->next;
VisitAll(L);
return 0;
}


//4.逆序遍历链表
int InOrderVisitAll(LinkList L){
LinkList p=L;
int len=getLength(p);
int *arr=new int[len];
int j=0;
int temp;
while(p&&j<len){
p=p->next;
temp=p->data;
arr[j]=temp;
++j;
}
printf("The InOrder Visit :");
for(int i=len-1;i>=0;i--){
printf("%d->",arr[i]);
}
printf("L \n");
return 0;
}


//5.查询某位置的节点，并放回其值
LinkList getOneNode(LinkList &L,int n){

LinkList p=L;int j=0;
int len=getLength(p);
LinkList node=(LinkList)malloc(sizeof(LNode));
if(n>len||n<1){
node=NULL;
return node;
}
while(p&&j<n){
p=p->next;
++j;
}
node=p;
return node;
}


//6.求链表长度
int getLength(LinkList &L){
int len=0;
LinkList p=L;
while(true){
if(p->next==NULL){
break;
}
p=p->next;
len++;
}
return len;
}


//7.正序遍历链表
void VisitAll(LinkList L)
{
L = L->next;
printf("L->");
while(L->next != NULL)
{
printf("%d->",L->data);
L = L->next;
}
printf("%d\n",L->data);
}


int main()
{
LinkList list = NULL;
int n;
int tem=0;
int len;
int pos;
int data;
int choose;
LinkList getnode=(LinkList)malloc(sizeof(LNode));
printf("Now,Create the linklist.\n");
printf("Please input the length of linklist:");
scanf("%d", &n);
CreateList_L(list, n);
printf("The LinkList has been Successed !\n");
VisitAll(list);
int ss=7;
while(ss==7){
printf("You have some options :\n");
printf(" 1.Insert One Node\n");
printf(" 2.Delete One Node\n");
printf(" 3.Visit All Nodes\n");
printf(" 4.Inorder Visit All\n");
printf(" 5.Get One Node\n");
printf(" 6.Get Length Of The Linklist\n");
printf(" 7.Go again\n");
printf(" 0.exit\n");
printf("Your choose:");
scanf("%d", &choose);
if(choose>7||choose<0){
choose=7;
printf("Please choose the number in options !!!\n");
}

switch(choose){
case 1:
printf("Insert One Node,Please input the new node's position:");
scanf("%d", &pos);
printf("Please input the new node's data:");
scanf("%d", &data);
List_InsertOne(list,pos,data);
printf("Have Inserted One...\n");
VisitAll(list);
printf("7.Go again 0r 0.exit :\n");
scanf("%d", &ss);
break;
case 2: printf("Delete which Of The LinkList:");
scanf("%d", &pos);
tem=List_DeleteOne(list,pos);
if(tem==0){
printf("It Has Deleted the Node %d...\n",pos);
}else{
printf("Deleted has bean Fialed....\n");
}
printf("7.Go again 0r 0.exit :\n");
scanf("%d", &ss);

break;
case 3: printf("The Linklist : \n");
VisitAll(list);
printf("7.Go again 0r 0.exit :\n");
scanf("%d", &ss);
break;
case 4: InOrderVisitAll(list);
printf("7.Go again 0r 0.exit :\n");
scanf("%d", &ss);
break;
case 5: printf("The Poisiton Of LinkList:");
scanf("%d", &pos);
getnode=getOneNode(list,pos);
data=getnode->data;
printf("The node %d 's data is %d...\n",pos,data);
printf("7.Go again 0r 0.exit :\n");
scanf("%d", &ss);
break;

case 6: len=getLength(list);
printf("The Length is %d ...",len);
printf("\n");
printf("7.Go again 0r 0.exit :\n");
scanf("%d", &ss);
break;
case 7: ss=7;
break;
case 0: printf ("It Has Been Quit...");
exit(0);
break;
}
}
return 0;
}