书上的代码总觉得有点问题

#include <stdio.h>
#include <stdlib.h>
struct link *AppendNopde(struct link *head);
void DisplyNode(struct link *head);
void DeleteMemory(struct link *head);
struct link
{
    int data ;
    struct link *next;
};
int main()
{
    int i=0;
    char x;
    struct link *head = NULL;
    printf("Do you want to append a new node ?\n");
    scanf("%c",&x);
    while(x=='y')
    {
        head = AppendNopde(head);
        DisplyNode(head);
        printf("Do you want to append a new node ?\n");
        scanf("%c",&x);
        ++i;
    }
    printf("%d new nodes had been appended \n",i);
    DeleteMemory(head);
    return 0;
}
struct link *AppendNopde(struct link *head)
{
    struct link *p = NULL,*pr = head;
    int data;
    p = (struct link *)malloc(sizeof(struct link));
    if (p==NULL)
    {
        printf("No enough memory to \n");
        exit(0);
        /* code */
    }
    if (head==NULL)
    {
        head = p;
        /* code */
    }
    else
    {
        while(pr->next!=NULL)
            pr=pr->next;
        pr->next=p;
    }
    printf("Input node data:\n");
    scanf("%d",&data);
    p->data = data;
    p->next = NULL;
    return head;
}
void DisplyNode(struct link*head)
{
    struct link *p = head;
    int j =1;
    while (p!=NULL)
    {
        printf("%5d%10d\n",j,p->data);
        p = p->next;
        ++j;
    }
}
void DeleteMemory(struct link *head)
{
    struct link *p = head ,*pr = NULL;
    while (p!=NULL)
    {
        pr = p;
        p = p->next;
        free(pr);
    }
}
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值