链表学习

细细理解

#include <stdio.h>
#include <iostream>
#include <string>
#include <string.h>
#include <math.h>
#include <algorithm>
#include <stdlib.h>
using namespace std;
struct film{
    char title[45];
    int rating;
    struct film * next;
};
int main()
{
    struct film * head = NULL;
    struct film * prev, * current;
    char input[45];
    
    puts("enter first movie title: ");
    while(gets(input) != NULL && input[0] != '\0'){
        current = (struct film *)malloc(sizeof(struct film));
        if(head == NULL)
           head = current;
        else
           prev->next = current;
        current->next = NULL;    
        strcpy(current->title,input);
        puts("rating : ");
        scanf("%d",&current->rating);
        while(getchar() != '\n')
           continue;
        puts("enter next movie title : ");
        prev = current;
    }
    if(head == NULL)
       printf("NO data entered.");
    else
       printf("Here is the movie list: \n");
    current = head;
    while (current != NULL)
    {
        printf("Movie: %s Rsting: %d\n",current->title,current->rating);
        current = current->next;
    }
    current = head;
    while (current != NULL)
    {
        free(current);
        current = current->next;
    }
    printf("Bye!\n");
    return 0;
}