C Primer Plus(第六版)17.12 编程练习 第1题 第一种方法

/* films2.c -- using a linked list of structures */

#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 {

struct film * last; /* points to last struct in list */

char titleTSIZE;

int rating;

struct film * next; /* points to next struct in list */

};

char * s_gets(char * st, int n);

int main(void)

{

struct film * head = NULL;

struct film * end = NULL;

struct film * prev, * current;

char inputTSIZE;

/* Gather and store information */

puts("Enter first movie title:");

while (s_gets(input, TSIZE) != NULL && input0 != '\0')

{

current = (struct film *) malloc(sizeof(struct film));

if (head == NULL) /* first structure */

{

head = current;

head->last = NULL;

}

else /* subsequent structures */

{

prev->next = current;

current->last = prev;

}

current->next = NULL;

strcpy(current->title, input);

puts("Enter your rating <0-10>:");

scanf("%d", &current->rating);

while(getchar() != '\n')

continue;

puts("Enter next movie title (empty line to stop):");

prev = current;

end = current;

}

/* Show list of movies */

if (head == NULL)

printf("No data entered. ");

else

printf ("Here is the movie Positive sequence list:\n");

current = head;

while (current != NULL)

{

printf("Movie: %s Rating: %d\n",

current->title, current->rating);

current = current->next;

}

if (head == NULL)

printf("No data entered. ");

else

printf ("Here is the movie inverted sequence list:\n");

current = end;

while (current != NULL)

{

printf("Movie: %s Rating: %d\n",

current->title, current->rating);

current = current->last;

}

/* Program done, so free allocated memory */

current = head;

while (current != NULL)

{

free(current);

current = current->next;

}

printf("Bye!\n");

return 0;

}

char * s_gets(char * st, int n)

{

char * ret_val;

char * find;

ret_val = fgets(st, n, stdin);

if (ret_val)

{

find = strchr(st, '\n'); // look for newline

if (find) // if the address is not NULL,

*find = '\0'; // place a null character there

else

while (getchar() != '\n')

continue; // dispose of rest of line

}

return ret_val;

}

相关推荐
Lsir10110_15 分钟前
从按钮“点不动“讲起——深入理解 Qt 信号槽机制
开发语言·qt·信号处理
君科程序定做17 分钟前
用 IDL 处理高分一号(GF-1 / GF-1B/C/D)数据
c语言·开发语言
敲代码的嘎仔19 分钟前
用 Redis 合并写 + DelayQueue 延迟检测,把视频播放进度写库频率降到 1/60
java·开发语言·数据库·redis·缓存·音视频·高并发
多弗朗皮卡丘1 小时前
数据结构6:队列
c语言·数据结构
xxxiugou1231 小时前
双指针解题秘籍:从入门到精通
c语言·数据结构·c++·算法
代码中介商1 小时前
C++ 预约系统实战(一):项目总览与 C/S 架构设计
c语言·开发语言·c++
我叫汪枫1 小时前
RAG 进阶:切分、检索、重排序,以及它和 Agent、微调、MCP 都是什么关系
开发语言·python
弘毅 失败的 mian1 小时前
数组和指针基础
c语言·开发语言·经验分享·笔记
ai小陈1 小时前
Python 3.12与CUDA 12.8镜像实战:启动GPU实例后的五项自检
开发语言·人工智能·python·深度学习·ai·gpu算力
Logic1011 小时前
C语言/数据结构位运算题解:异或XOR找出地铁规划中的“独特坐标“——只出现一次的数字
c语言·数据结构·数组·位运算·时间复杂度·算法题·异或性质