我正在开发一个程序,使用递归反向打印链表。我的递归代码似乎只打印出最后一部电影,然后停止。 "获取"在Microsoft Visual Studio中不起作用,因此我使用的是在线编译,并且无法访问调试器。预期产量低于。该代码也发布在下面。
Enter first movie title:
Titanic
Enter your rating<0-10>:
5
Enter next movie title:
Inception
Enter your rating<0-10>:
8
Here is the movie list:
Movie: Titanic Rating: 8
Movie: Inception Rating: 9
Display list from tail to head:
Here is the movie list:
Movie: Inception Rating : 9
Movie: Titanic Rating : 8
实际输出:
Here is the movie list:
Movie: Titanic Rating: 8
Movie: Inception Rating: 9
Display list from tail to head:
Here is the movie list:
Movie: Inception Rating : 9
#include <stdio.h>
#include <stdlib.h> /* has the malloc prototype */
#include <string.h> /* has the strcpy prototype */
#define TSIZE 45 /* size of array to hold title */
struct film
{
char title[TSIZE];
int rating;
struct film* next; /* points to next struct in list */
struct film* prev;
};
int main(void)
{
struct film *head = NULL, *prev, *current, *temp;
struct film *tail = NULL;
char input[TSIZE];
/* Gather and store information */
puts("Enter first movie title:");
while (gets(input) != NULL && input[0] != '\0')
{
current = (struct film *) malloc(sizeof(struct film)); //request a new film struct
if (head == NULL) /* first structure */
head = current;
else /* subsequent structures */
prev->next = current;
current->next = NULL;
strcpy(current->title, input);
puts("Enter your rating <0-10>:");
scanf("%d", ¤t->rating);
while (getchar() != '\n')
continue;
puts("Enter next movie title (empty line to stop):");
prev = current;
tail = current;
}
/* Show list of movies */
if (head == NULL)
printf("No data entered. ");
else
printf("Here is the movie list:\n");
current = head;
while (current != NULL)
{
printf("Movie: %s Rating: %d\n",
current->title, current->rating);
current = current->next;
}
puts("Display list from tail to head:");
if (tail == NULL)
puts("No data entered.");
else
puts("Here is the movie list: ");
current = tail;
while (current != NULL)
{
printf("Movie: %s Rating : %d\n", current->title, current->rating);
current = current->prev;
}
/* Program done, so free allocated memory */
current = head;
while (current != NULL)
{
temp = current->next;
free(current);
current = temp;
}
return 0;
}
答案 0 :(得分:1)
您在结构中未填写current-&gt; prev字段:
if (head == NULL) /* first structure */
{
head = current;
current->prev = NULL;
}
else /* subsequent structures */
{
current->prev = prev;
prev->next = current;
}
答案 1 :(得分:0)
您没有设置插入节点的数据成员prev
。你应该写例如
if (head == NULL) /* first structure */
{
head = current;
current->prev = NULL;
}
else /* subsequent structures */
{
prev->next = current;
current->prev = tail;
}
考虑到在此循环中使用变量prev
是多余的。
此外,函数gets
不安全,不再受C标准支持。而是使用函数fgets
。