1.c.txt

这是个NPC问题求解

#include<stdio.h>
#include<malloc.h>
#define OK 1
#define ERROR 0
typedef int Status;
typedef struct ElemType{
  int age;
  char no[7];
  float score;
  }ElemType;
typedef struct LNode{
  ElemType data;
  struct LNode *next;
 }LNode,*LinkList;

void CreateList_L(LinkList L,int n);
Status GetElem_L(LinkList L,int i,ElemType &e);
Status ListInsert_L(LinkList L,int i,ElemType e);
Status ListDelete_L(LinkList L,int i,ElemType &e);

void main(){



}


void CreateList_L(LinkList &L,int n){

L=(LinkList) malloc(sizeof(LNode));
L->next=NULL;
for(i=a;i>0;-i){
p=(LinkList) malloc(sizeof(LNode));
scanf(&p->data);
 p->next=L->next;L->next=p;
 }
}


Status GetElem_L(LinkList L,int i,ElemType &e){
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_L(LinkList &L,int i,ElemType e){

p=L;j=0;
while(p&&j<i-1){
     p=p->next;++j;
}
if(!p||j>i-1)return ERROR;
s=(linkList)malloc(sizeof(LNode));
s->data=e;s->next=p->next;
p->next=s;
return OK;
}

Status ListDelete_L(LinkList L,int i,ElemType &e){

p=L;j=0;
while(p->next&&j<i-1;){
p=p->next;++j;}
if(!(p->next)||j>i-1)return ERROR:
q=p->next;p->next=q->next;
e=q->data;free(q);
return OK;
}