单链表头插法的实现

#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <ctype.h>

typedef struct node{
    char data[10];
    struct node*next;
}ListNode;

typedef ListNode *LinkList;
LinkList CreatListR1();
LinkList CreatList();
ListNode *LocateNode(LinkList head,char *key);
void DeleteList();
void printlist(LinkList head);
void DeleteAll(LinkList head);
ListNode *AddNode(LinkList head);

int main(){
    char ch[10],num[5];
    LinkList head;
    head=CreatList();
    printlist(head);
    printf("Delete Node(y/n):");
    scanf("%s",num);
    if(strcmp(num,"y")==0||strcmp(num,"Y")==0){
        head=AddNode(head);
    }
    printlist(head);
    system("pause");
    DeleteAll(head);
}


LinkList CreatListR1(){
    char ch[10];
    LinkList head=(LinkList)malloc(sizeof(ListNode));
    ListNode*s,*r,*pp;
    r=head;
    r->next==NULL;
    printf("Input # to end");
    printf("
Please input Node_data ");
    scanf("%s",ch);
    while(strcmp(ch,"#")!=0){
        pp=LocateNode(head,ch);
        
        if(pp==NULL){
            s=(ListNode *)malloc(sizeof(ListNode));
            strcpy(s->data,ch);
            r->next=s;
            r=s;
            r->next=NULL;
        }
        printf("Input # to end ");
        printf("Please input Node_data:");
        scanf("%s",ch);
    }
    return head;
}



LinkList CreatList(){
    char ch[100];
    LinkList head,p;
    head=(LinkList)malloc(sizeof(ListNode));
    head->next=NULL;
    while(1){
        printf("Input # to end ");
        printf("Please input Node_data:");
        scanf("%s",ch);
        if(strcmp(ch,"#")){
            if(LocateNode(head,ch)==NULL){
                strcpy(head->data,ch);
                p=(LinkList)malloc(sizeof(ListNode));
                p->next=head;
                head=p;
            }
        }
        else
            break;
    }
    return head;
}

ListNode *LocateNode(LinkList head,char *key){
    ListNode *p=head->next;
    while(p!=NULL&&strcmp(p->data,key)!=0){
        p=p->next;
    }
    return p;
}

ListNode *AddNode(LinkList head){
    char ch[10];
    ListNode *s,*pp;
    printf("
Please input a New Node_data:");
    scanf("%s",ch);
    pp=LocateNode(head,ch);
    if(pp==NULL){
        s=(ListNode *)malloc(sizeof(ListNode));
        strcpy(s->data,ch);
        s->next=head->next;
        head->next=s;
    }
    return head;
}

void DeleteList(LinkList head,char *key){
    ListNode *p,*r,*q=head;
    p=LocateNode(head,key);
    if(p==NULL){
        printf("position error");
        exit(0);
    }
    while(q->next!=p)
        q=q->next;
    r=q->next;
    q->next=r->next;
    free(r);
}

void printlist(LinkList head){
    ListNode *p=head->next;
    while(p){
        p=p->next;
    }
    printf("
");
}
void DeleteAll(LinkList head){
    ListNode *p=head,*r;
    while(p->next){
        r=p->next;
        free(p);
        p=r;
    }
    free(p);
}

有些飘，时间安排的也不是很合理，稀里糊涂的度日子。从基础开始，从现在开始，加油吧，少年郎。