typedef int ElemType;
typedef struct Node //结点结构
{
ElemType data;
struct Node *next;
}Node;
typedef struct Node *LinkList;
Status ListDelete(LinkList *L,int i,ElemType *e) //单链表删除
{
int j; LinkList p,q; p = *L; j = 1;
while (p->next && j < i)
{ p = p->next; ++j;}
if (!(p->next) || j > i)
return ERROR;
q = p->next;
p->next = q->next;
*e = q->data; //?????没明白这句作用
free(q);
return OK;
}
就是注释的那句实在想不明白是干嘛用的,求解~~~