严蔚敏--线性表的链式表示和实现 代码

#include<iostream>
#include<stdio.h>
#include<stdlib.h>
using namespace std;
//----------线性表的动态分配链存储结构-------------
#define LIST_INT_SIZE 100
#define LISTINCREATMENT 10
#define OVERFLOW -2
#define OK 1
#define ERROR 0
typedef int ElemType;
typedef struct LNode{
  ElemType data;
  struct LNode*next;
}LNode,*LinkList;
void CreateList(LinkList&L,int arr[],int n){
  L=(LinkList)malloc(sizeof(LNode));//创建一个头节点
  L->next=NULL;
  LinkList p;
  for(int i=0;i<n;++i){
    p=(LinkList)malloc(sizeof(LNode));
    p->data=arr[i];
    p->next=L->next;L->next=p;
  }
}
int GetElem(LinkList L,int i,ElemType &e){
  LinkList p=L;int j=1;
  while(p&&j<i){
    p=p->next;j++;
  }
  if(!p || j>i)return ERROR;
  e=p->data;
  return OK;
}
int ListInsert(LinkList & L,int i,ElemType e){
  //带头节点的单链表中底i个位置之前插入e
  LinkList p=L;  int j=1;
  while(p && j<i){
    p=p->next;j++;
  }
  if(!p || j>i)return ERROR;
  LinkList s=(LinkList)malloc(sizeof(LNode));
  s->data=e;s->next=p->next;
  p->next=s;
  return OK;
}
int ListDelete(LinkList&L,int i,ElemType&e){
  //删除第i个元素
  LinkList p=L;int j=1;
  while(p&&j<i){//p指向第i个节点的前趋节点
    p=p->next;j++;
  }
  if(!p || j>i)return ERROR;
  LinkList tmp=p->next;p->next=tmp->next;
  e=tmp->data;free(tmp);
  return OK;
}
void print(LinkList L){
  while(L->next){
    cout<<L->next->data<<" ";
    L=L->next;
  }
  cout<<endl;
}
int main(int argc, char **argv)
{
  LinkList L;
  ElemType arr[]={1,2,3,4,5,6,7,8,9};
  CreateList(L,arr,sizeof(arr)/sizeof(ElemType));
  print(L);
  ListInsert(L,1,0);
  cout<<"After Insert 0"<<endl;
  print(L);int tmp;
   cout<<ListDelete(L,1,tmp);
  cout<<"After Delete"<<endl;
  print(L);


    return 0;
}