typedef int ElemType;
typedef struct LNode{
ElemType data;
struct LNode *next;
}LNode, *LinkList;
using namespace std;
Status InitList(LinkList &L){
L = new LNode;
L->next == NULL;
return OK;
}
Status GetElem(LinkList L, int i, ElemType &e){
LNode *p = L->next;
int j = 1;
while(p && j < i){
p = p->next;
j ++;
}
if(!p || j > i) return ERROR;
e = p->data;
return OK;
}
LNode *LocateElem(LinkList L, ElemType e){
LNode *p = L->next;
while(p && (p->data != e))
p = p->next;
return p;
}
Status ListInsert(LinkList &L, int i, ElemType e){
LNode *p = L;
int j = 0;
while( p && (j < i - 1)){
p = p->next;
j ++;
}
if(!p || j > i - 1) return ERROR;
LNode* s = new LNode;
s->data = e;
s->next = p->next;
p->next = s;
return OK;
}
Status ListDelete(LinkList &L, int i){
LNode *p = L;
int j = 0;
while((p->next) && (j < i - 1)){
p = p->next;
j ++;
}
if(!(p->next) || (j > i - 1)) return ERROR;
LNode *q = p->next;
p->next = q->next;
delete q;
return OK;
}
void CreateList_tou(LinkList &L, int n){
L = new LNode;
L->next = NULL;
for(int i = 0; i < n; i ++){
LNode *p = new LNode;
cin >> p->data;
p->next = L->next;
L->next = p;
}
}
void CreateList_wei(LinkList &L, int n){
L = new LNode;
L->next = NULL;
LNode *r = L;
for(int i = 0; i < n; i ++){
LNode *p = new LNode;
cin >> p->data;
p->next = NULL;
r->next = p;
r = p;
}
}