Описать структуру с именем TRAIN - C++ - Ответ 2382640

#include <string.h>
#include <stdlib.h>
#include <stdio.h>
 
typedef struct Train {
  char *destination;
  size_t number;
  size_t departTime;
} Train;
 
Train trainCopy(const char *destination, size_t number, size_t departHour,
  size_t departMinute) {
  Train train = {0, number, departHour * 60 + departMinute};
  train.destination = (char*)malloc(strlen(destination) + 1);
  strcpy(train.destination, destination);
  return train;
}
 
void trainPrint(Train train) {
  printf("#%04d, Destination: %s, departure: %02d:%02d\n",
    train.number, train.destination, train.departTime / 60,
    train.departTime % 60);
}
 
typedef struct TrainListNode {
  Train train;
  struct TrainListNode *prev;
  struct TrainListNode *next;
} TrainListNode;
 
typedef struct TrainList {
  TrainListNode *begin;
  size_t size;
} TrainList;
 
TrainListNode *trainListGetLastNode(TrainList *list) {
  if (list->begin == NULL)
    return NULL;
  TrainListNode *last = list->begin;
  while (last->next != NULL)
    last = last->next;
  return last;
}
 
void trainListInsertSorted(TrainList *list, const char *destination, size_t number, size_t departHour,
  size_t departMinute) {
  TrainListNode *node = (TrainListNode*)malloc(sizeof(TrainListNode));
  node->train = trainCopy(destination, number, departHour, departMinute);
  node->next = node->prev = 0;
  if (list->begin == NULL) {
    list->begin = node;
    list->size = 0;
  } else {
    TrainListNode *before = list->begin;
    while (before != NULL && before->train.number < number)
      before = before->next;
    if (before != NULL) {
      node->next = before;
      node->prev = before->prev;
      node->next->prev = node;
      if (node->prev != NULL)
        node->prev->next = node;
      else //if (before == list->begin)
        list->begin = node;
    } else {
      TrainListNode *last = trainListGetLastNode(list);
      node->prev = last;
      last->next = node;
    }
    ++(list->size);
  }
};
 
Train *trainListFindFirstByNumber(TrainList *list, size_t number) {
  TrainListNode *node = list->begin;
  while (node != NULL && node->train.number < number)
    node = node->next;
  if (node != NULL && node->train.number == number)
    return &(node->train);
  else
    return NULL;
}
 
void trainListDelete(TrainList *list) {
  while (list->begin != NULL) {
    TrainListNode *next = list->begin->next;
    free(list->begin->train.destination);
    free(list->begin);
    list->begin = next;
  }
}
 
void trainListPrint(TrainList *list) {
  TrainListNode *node = list->begin;
  for (; node != NULL; node = node->next)
    trainPrint(node->train);
}
 
void lookForTrain(TrainList *list, size_t number) {
  Train *found = trainListFindFirstByNumber(list, number);
  if (found == NULL) {
    printf("Train number %d was not found.\n", number);
  } else {
    printf("Train number %d found:\n", number);
    trainPrint(*found);
  }
}
 
int main(int argc, char *argv[]) {
  TrainList list = {0, 0};
  trainListInsertSorted(&list, "Moscow", 13, 9, 22);
  trainListInsertSorted(&list, "Novgorod", 14, 17, 15);
  trainListInsertSorted(&list, "St. Petersburg", 4, 10, 1);
  trainListInsertSorted(&list, "Kiev", 17, 23, 0);
  trainListInsertSorted(&list, "Vladivostok", 1, 2, 5);
  trainListInsertSorted(&list, "Zelenogorsk", 204, 14, 8);
  trainListInsertSorted(&list, "Zelenogorsk", 207, 7, 2);
  trainListPrint(&list);
 
  int i;
  for (i = 0; i < 20; ++i)
    lookForTrain(&list, i);
 
  trainListDelete(&list);
  return 0;
};