#include <stdio.h> #define len sizeof(struct a) #include <malloc.h>

typedef struct b {char lk; struct b *next ; }a,*Linklist;

void output(a *head){ a *p; p=head; while (p != NULL)

{ printf("%c ",p->lk); p=p->next; } printf("\n"); }

Linklist Deletechar(a *head) {a *p,*q,*o; char ch; o=q=p=head; printf("\ninput deleted letter:"); scanf("%c",&ch); while(ch != '0') { q=p=head;

while(p->lk != ch && p != NULL) {q=p; p=p->next;} if(p==head) { head=head->next;free(p); } else { if(p->lk == ch)

{ q->next=p->next; free(p) ; } else printf("can't find it "); } printf("deleted ago is :\n"); output(head); printf("plese input delete char:\n"); fflush(stdin);/*在此加上清流函数 */ scanf("%c",&ch); } return o; } Linklist insert(a *head) { a *p,*q,*s,*o; char ch; o=q=p=head; printf("\ninput insert letter:"); fflush(stdin); scanf("%c",&ch); while(ch != '0') { q=p=head; while(p->lk < ch && p != NULL) { q=p; p=p->next;}

if(p == head) { if(p->lk==ch) {printf("it is exist !!!!\n");} else

{ if((s=(a *)malloc(sizeof(a)))==NULL) exit(1); /*s=(struct a *) malloc(len);*/ s->lk=ch; s->next=p; head=p=s;} } else { if(p->lk != ch) { if((s=(a *)malloc(sizeof(a)))==NULL) exit(1); /*s=(struct a *) malloc(len);*/ s->lk=ch; s->next=p; q->next=s; q=p=head;} else { printf("888 it is exist\n"); q=p=head;}

} printf("inserted:\n"); output(head); printf("plese input insert char:\n"); fflush(stdin);/*在此加上清流函数 */ scanf("%c",&ch); } return head;

}

main() {struct a *head,*p,*q,*s; int i; if((p=(a *)malloc(sizeof(a)))==NULL) exit(1); head=p; for(i=1;i<=25;i++) { (p->lk)=('a'+i-1); if((p->next=(a *)malloc(sizeof(a)))==NULL) exit(1); p=p->next;

} p->lk='z'; p->next=NULL; p=head; printf("26 char is :\n"); output(head); Deletechar(head); insert(head);

} 插入操作有问题，大家看看怎么改一下````谢谢了``` 删除一个字母后，在插就死循环`````

斑竹运行这个 带头节点的 都没问题```````` #include<stdio.h> #include<malloc.h> #include<stdlib.h> typedef struct Node{ char data; struct Node *next; }SLNode,*Linklist; void output(SLNode *head){ SLNode *p; p=head; while(p->next!=NULL){ printf("%c ",p->next->data); p=p->next; } printf("\n"); } Linklist Deletechar(SLNode *head) { SLNode *p,*q; char ch; p=head; printf("please input delete char(The zero is over ! ):\n"); scanf("%c",&ch); while(ch!='0') { p=head; while(p->next!=NULL&&p->next->data<ch) p=p->next; if(p->next->data!=ch) printf("No fine the delete char\n"); else { q=p->next; p->next=q->next; free(q); q=NULL; } printf("deleted:\n"); output(head); printf("plese input delete char:\n"); fflush(stdin);/*在此加上清流函数 */ scanf("%c",&ch); } return head; } Linklist insert(SLNode *head) { SLNode *p,*q; char ch; printf("please input your char(The zero is over ! ):\n"); scanf("%c",&ch); while(ch!='0') { p=head; while(p->next!=NULL&&p->next->data<ch) p=p->next; if(p->next->data==ch) printf("list have a char\n"); else { if((q=(SLNode *)malloc(sizeof(SLNode)))==NULL)exit(1); q->data=ch; q->next=p->next; p->next=q; } printf("inserted:\n"); output(head); printf("plese input insert char:\n"); fflush(stdin);/*在此加上清流函数 */ scanf("%c",&ch); } return head;

} main() {SLNode *head,*p,*q; int i; char exit2;

if((head=(SLNode *)malloc(sizeof(SLNode)))==NULL) exit(1); head->next=NULL; p=head; for(i=0;i<26;i++) { if((q=(SLNode *)malloc(sizeof(SLNode)))==NULL)exit(1); (q->data)=('a'+i); q->next=NULL; p->next=q; p=q; q=NULL; } p=head; printf("26 char:\n"); output(head); printf("\n"); do{ Deletechar(head); insert(head); printf("exit is input k :"); fflush(stdin); scanf("%c",&exit2); } while(exit2 != 'k') ; }

谢谢您斑竹````真热心````

我得出去走走去```