算法与数据结构 火车车次管理系统
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
typedef struct{
char train_number[20];
char departure_station[50];
char destination_station[50];
char run_time[50];
} Train;
typedef struct Node{
Train data;
struct Node *next;
}ListNode,*LinkList;
ListNode *p ;
LinkList head;
LinkList CreatList(void);
void InsertNode(LinkList head,ListNode *p);
ListNode *ListFind(LinkList head);
void DeleteNode(LinkList head);
void ChangeNode(LinkList head);
void PrintList(LinkList head);
int menu_Train();
LinkList CreatList(void )
{
LinkList head=(LinkList)malloc(sizeof(ListNode));
ListNode *p,*rear;
char f='y';
rear=head;
while(f=='y'||f=='Y')
{
p=(ListNode*)malloc(sizeof(ListNode));
printf("请按顺序输入车次,始发站,终点站,运行时间:\n");
printf("--------------------------------------------\n");
scanf("%s%s%s%s",p->data.train_number,p->data.departure_station,p->data.destination_station,p->data.run_time);
rear->next=p;
rear=p;
printf("是否继续输入?(y/n)");
getchar();
scanf