回顾数据结构（1）：单链表

//定义链表结构
typedef struct LNode{
ElemType data;
struct LNode *next;
}Node,*LinkList;

//创建链表
Status CreateLinkList(LinkList &L,int n){
LinkList p,head;
L = (LinkList)malloc(sizeof(Node));
if(!L) return ERROR;
L->next = NULL;
head = L;
printf("input data:\n");
for(int i = 0;i<n;i++){
p = (LinkList)malloc(sizeof(Node));
if(!p) return ERROR;
scanf("%d",&p->data);
p->next = NULL;
head->next = p;
head = p;
}
return OK;

}

//获取元素
Status GetItem(LinkList L ,int i,ElemType &e){
LinkList head ;
head = L->next;
int j = 0;
while(head &&j<i-1){
head  = head ->next;
++j;
}
if(!head ||j>i-1){
return ERROR;
}
e = head->data;
return OK;
}

//遍历链表
Status ReadLinkList(LinkList L){
printf("output data:\n");
LinkList p;
p = L->next;
if(!p) {
printf("error");
return ERROR;
}
while(p!= NULL){
printf("%d ",p->data);
p = p->next;
}
return OK;
}

Status InertItem(LinkList L,int i,ElemType e){
LinkList head,temp;
int j=0;
head = L;
while(head&&j<i-1){
head = head->next;
++j;
}
if(!head&&j>i-1) return ERROR;

temp = (LinkList)malloc(sizeof(Node));
if(!temp) return ERROR;
temp->data = e;
temp->next = head->next;
head->next = temp;
return OK;
}

Status deleteLinkList(LinkList L,int i){
LinkList head,temp;
head = L;
int j=0;

while(head->next&&j<i-1){
head = head->next;
++j;
}
if(!head->next||j>i-1) return ERROR;
temp = head->next;
head->next = temp->next;
printf("delete item is: %d",temp->data);
free(temp);
return OK;
}

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

#define OK 1;
#define ERROR 0;
typedef int  Status;
typedef int  ElemType;

//定义链表结构
typedef struct LNode{
ElemType data;
struct LNode *next;
}Node,*LinkList;

//创建链表
Status CreateLinkList(LinkList &L,int n){
LinkList p,head;
L = (LinkList)malloc(sizeof(Node));
if(!L) return ERROR;
L->next = NULL;
head = L;
printf("input data:\n");
for(int i = 0;i<n;i++){
p = (LinkList)malloc(sizeof(Node));
if(!p) return ERROR;
scanf("%d",&p->data);
p->next = NULL;
head->next = p;
head = p;
}
return OK;

}
//遍历链表
Status ReadLinkList(LinkList L){
printf("output data:\n");
LinkList p;
p = L->next;
if(!p) {
printf("error");
return ERROR;
}
while(p!= NULL){
printf("%d ",p->data);
p = p->next;
}
return OK;
}
//获取元素
Status GetItem(LinkList L ,int i,ElemType &e){
LinkList head ;
head = L->next;
int j = 0;
while(head &&j<i-1){
head  = head ->next;
++j;
}
if(!head ||j>i-1){
return ERROR;
}
e = head->data;
return OK;
}
Status InertItem(LinkList L,int i,ElemType e){
LinkList head,temp;
int j=0;
head = L;
while(head&&j<i-1){
head = head->next;
++j;
}
if(!head&&j>i-1) return ERROR;

temp = (LinkList)malloc(sizeof(Node));
if(!temp) return ERROR;
temp->data = e;
temp->next = head->next;
head->next = temp;
return OK;
}
Status deleteLinkList(LinkList L,int i){
LinkList head,temp;
head = L;
int j=0;

while(head->next&&j<i-1){
head = head->next;
++j;
}
if(!head->next||j>i-1) return ERROR;
temp = head->next;
head->next = temp->next;
printf("delete item is: %d",temp->data);
free(temp);
return OK;
}
int main()
{
LinkList L;
L = NULL;
int num;
printf("input the length of LinkList:\n");
scanf("%d",&num);
CreateLinkList(L,num);
ReadLinkList(L);
ElemType e;
printf("\ninput the item index:\n");
scanf("%d",&num);
GetItem(L,num,e);
printf("%d",e);
printf("\ninput the insert item and it's index:\n");
int index;
scanf("%d",&e);
scanf("%d",&index);
InertItem(L,index,e);
printf("\nafter insert action linkList\n");
ReadLinkList(L);
printf("\nafter delete index \n");
scanf("%d",&index);
deleteLinkList(L,index);
printf("\nafter delete action linkList\n");
ReadLinkList(L);
}