LinkList顺序表
#include<bits/stdc++.h>
using namespace std;
#define MAXSIZE 20
#define OK 1
#define ERROR 0
#define TRUE 1
#define FALSE 0
typedef int ElemType;
typedef int Status;
typedef struct Node{
ElemType data;
struct Node *next;
};
typedef struct Node *LinkList;
Status GetElem(LinkList L,int i,ElemType *e){
int j;
LinkList p;
p=L->next;
j=1;
while(p && j<i){
p=p->next;
j++;
}
if (!p || j>i)
return ERROR;
*e=p->data;
return OK;
}
Status ListInsert(LinkList *L,int i,ElemType e){
int j;
LinkList p,s;
p=*L;
j=1;
while(p && j<i){
p=p->next;
j++;
}
if(!p || j>i)
return ERROR;