0

enter code here在主函数中，我调用 add 函数和 display 函数来查看所有当前节点及其存储的数据到链表中。但每次它只显示第一个节点值而不是其他节点。我在我的代码中找不到任何错误。任何身体都可以帮助...

这是我的代码：-

struct student* add(struct student*);
struct student* search(struct student*);
struct student* modify(struct student*);
void display(struct student* head);
struct student
{
    int roll;
    char name[50];
    float percentage;
    struct student *address;
};
int nodes=0;//nodes variable keeps the data of the total no of nodes present in to the inked list.
int main()
{
    struct student *head;
    int choice;
    char mychoice='y';
    head=NULL;
    do
    {
        printf("Enter 1 to add a node.\nEnter 2 to display all existing record.\nEnter 3 to search a record.\nEnter 4 to modify an existing record.\nEnter your choice: ");
        scanf("%d",&choice);
        switch(choice)
        {
            case 1:
                head=add(head);
                display(head);
                //break;
            case 2:
                display(head);
                break;
            case 3:
                head=search(head);
                break;
            case 4:
                head=modify(head);
                break;
            default:
                printf("Enter any of the correct input.\n");
                break;
        }
        printf("\nDo you want to continue? [Y/N]");
            scanf(" %c",&mychoice);
    }while(mychoice=='y'||mychoice=='Y');
    return 0;
}

struct student* add(struct student* head)
{
    struct student *node,*temp;
    node=(struct student*)malloc(sizeof(struct student));
    temp=head;
    printf("Enter the name of the student: ");
    scanf("%s",&(node->name));
    printf("Enter the roll of the student: ");
    scanf("%d",&(node->roll));
    printf("Enter the percentage: ");
    scanf("%f",&(node->percentage));
    node->address=NULL;
    if(head==NULL) // Implies an empty list.
        head=node;
    else
    {
        temp=head;
        while(temp!=NULL)//Traversing to the last node.
            temp=temp->address;
        temp=node;
    }
    nodes++;
    return head;
}

struct student* search(struct student* head)
{
    int m;
    printf("Enter the no of node you wanna search: ");
    scanf("%d",&m);
    if(m>nodes)
        printf("%dth node does not exist.",m);
    else
        {
            for(i=0;i<m;i++)// Traversing node to node to go to the mth node.
                temp=temp->address;
            printf("\nThe name of the student is: %s\nThe roll no of the student is: %d \nThe percentage of the student is: %5.2f \n\n",temp->name,temp->roll,temp->percentage);            
        }
    return head;
}

struct student* modify(struct student* head)
{
    int m,i;
    struct student *temp;
    temp=head;
    printf("Enter the index no of node you wanna change: ");
    scanf("%d",&m);
    if(m>nodes)
        printf("%dth node does not exist.",m);
    else
        {
            for(i=0;i<m;i++)// Traversing node to node to go to the mth node.
                temp=temp->address;
            printf("Enter the new name of the student: ");
            scanf("%s",&(temp->name));
            printf("Enter the new roll of the student: ");
            scanf("%d",&(temp->roll));
            printf("Enter the new percentage: ");
            scanf("%f",&(temp->percentage));
        }
    return head;
}

void display(struct student* head)
{
    struct student *temp;
    temp=head;
    while(temp!=NULL)
    {
        printf("\nThe name of the student is: %s\nThe roll no of the student is: %d \nThe percentage of the student is: %5.2f \n\n",temp->name,temp->roll,temp->percentage);
        temp=temp->address;
    }
}
4

1 回答 1

2

对于add功能，您的问题在这里：

    temp=head;
    while(temp!=NULL)//Traversing to the last node.
        temp=temp->address;
    temp=node;

您永远不会使当前的最后一个节点指向新节点。您所做的是将新节点分配给temp然后返回。当您返回temp时超出范围并且新节点丢失。

要插入新节点，您需要更新address最后一个节点。在伪代码中，您需要执行以下操作：

// Pseudo code to insert a new tail node
current_last_node->address = new_node;

尝试这样的事情：

    temp=head;
    while(temp->address!=NULL)//Traversing to the last node.
        temp=temp->address;
    temp->address=node;

顺便说一句：调用指向列表下一个元素的指针address是不正常的。约定是使用名称next。

另外两条评论：

1) 由于您想添加到列表的末尾，因此最好有一个tail指针以获得更好的性能。

2）你应该收集head,nodes并tail放入一个结构中。

就像是：

struct student_list
{
    struct student *head;
    struct student *tail;
    int nodes;
};

int main()
{
    struct student_list list = {NULL, NULL, 0};
    add(&list);
    ...
    ...
}

那么add函数将是：

void add(struct student_list* list)
{
    struct student *node;
    node=malloc(sizeof *node);

    // Read data into node

    node->address=NULL;

    if(list->head==NULL) // Implies an empty list.
    {
        list->head=node;
    }
    else
    {
        list->tail->address=node;
    }
    list->tail=node;
    list->nodes++;
}

现在函数中没有循环，所以添加元素是 O(1)，即更好的性能。

于 2019-08-08T06:59:45.623 回答