链表节点的删除（无重复）

#include

#include

#define N 9

typedef struct node{

int data;

struct node * next;

}ElemSN;

ElemSN * Createlink(int a[],int n){ //逆向创建单向链表

int i;

ElemSN * h=NULL, * p;

for( i=N-1;i>=0;i--){

p=(ElemSN *)malloc(sizeof(ElemSN));

p->data =a[i];

p->next=h;

h=p;

}

return h;

}

void printlink(ElemSN * h){

ElemSN * p;

for(p=h;p;p=p->next)

printf("%d\n",p->data);

}

ElemSN * Delingkeynode(ElemSN*h,int key) {

ElemSN * p;

ElemSN * q=NULL;

for(p=h;p&&p->data!=key;q=p,p=p->next); //遍历链表，如果找到key指针p不为空，且p指针是q指针的next

if(!p) //key不存在

printf("NO\n");

else {

if(p-h) //key不是头结点

q->next=p->next; //挂链

else

h=h->next; //key是头指针，头指针后移

}

free(p); //释放p指针

return h;

}

int main(void){

int a[]={1,2,3,4,5,6,7,8,9};

int key;

ElemSN * head;

head=Createlink(a,9);

printf("key=");

scanf("%2d",&key);

head=Delingkeynode(head,key);

printlink(head);

}