Question

c++ program that takes user input from the console and store the data into a linked list. The input made of 4 objects associated to a car: model, make, mileage and year. My program should take the how many inputs the user want to make, followed by the inputs themselves. After the input, my program should print the data inside the linked list. So far, the issue is that my program print some of the input, but not all. 

Input sample:

3

Honda

Sentra

8900

2017

Toyota

Camri

109827

1999

Nissan

Sentra

8726

1987

current output:

Honda 0 0

Sentra 8900 2017 0

Toyota Camri 109827 1999

-------------

but the output should be:

Honda Sentra 8900 2017

Toyota Camri 109827 1999

Nissan Sentra 8726 1987

_________________________________________

Car.h

#ifndef Car_h

#define Car_h

#include

struct Car{

std::string model, make;

int mileage;

int year;

Car *next;

};

//void populate(Car *);

//void display(Car *);

//void insert(Car *);

#endif /* Car_h */

_______________________________________________

main.cpp

#include

#include"Car.h"

#include

using namespace std;

void populate(Car *newRecord)

{

getline(cin,newRecord->model);

cin.clear();

getline(cin,newRecord->make);

cin.clear();

cin >> newRecord->mileage;

cin.clear();

cin >> newRecord->year;

cin.clear();

return;

}

void display(Car *content)

{

while(content != NULL)

{

cout << content->model <<" ";

cout<< content->make <<" ";

cout << content->mileage <<" ";

cout << content->year << endl;

content = content->next;

}

cout << endl;

return;

}

//void insert(Car *)

int main()

{

Car *myCar, *current;

myCar = new Car;

current = myCar;

int x = 0;

cout << " How many cars do you want to compare? " << endl;

cin >> x;

cin.clear();

//Car myCar[x];

for(int i = 0; i < x - 1; ++i)

{

populate(current);

current->next = new Car;

current = current->next;

}

populate(current);

current->next = NULL;

cout <<"\nlist consists of:\n";

display(myCar);

  

return 0;

}

Answer 1

-------------------- I used Visual Studio 2013, C++ Language, Console Application --------------------

-------------------- OUTPUT --------------------

-------------------- CODE --------------------

#include "stdafx.h"
#include
#include
using namespace std;

struct Car
{
   string model, make;
   int mileage, year;
   struct Car *next;
};

/* insert new node at the end of the linked list */
void append(struct Car** head, string make, string model, int mileage, int year)
{
   //Create and allocate node
   struct Car* newNode = new Car;

   struct Car *last = *head;

   //Assign data to the node
   newNode->make = make;
   newNode->model = model;
   newNode->mileage = mileage;
   newNode->year = year;

   //Set next pointer of new node to null as its the last node
   newNode->next = NULL;

   //If list is empty, new node becomes first node
   if (*head == NULL)
   {
       *head = newNode;
       return;
   }

   //Else traverse till the last node
   while (last->next != NULL)
       last = last->next;

   //Change the next of last node
   last->next = newNode;
   return;
}

void display(struct Car *node)
{
   cout << "\nDisplay :: " << endl;
   while (node != NULL)
   {
       cout << node->make << " " << node->model << " " << node->mileage << " " << node->year << endl;
       node = node->next;
   }
}

int main()
{
   struct Car* head = NULL;
   int count, mileage, year;
   count = mileage = year = 0;
   string make, model;
   make = model = "";
   cout << "Please enter how many car(s) : ";
   cin >> count;
  
   while (count>0)
   {
       cout << endl;
       cout << "Please enter car make : ";
       cin.ignore();
       getline(cin, make);
       cout << "Please enter car model : ";
       getline(cin, model);
       cout << "Please enter car mileage : ";
       cin >> mileage;
       cout << "Please enter car year : ";
       cin >> year;
       append(&head, make, model, mileage, year);
       count--;
   }
   display(head);
   system("pause");
   return 0;
}

-------------------- -------------------- -------------------- -------------------- -------------------- --------------------
-------------------- -------------------- -------------------- -------------------- -------------------- --------------------