bogdanNiculeasa

invalid-code-add-to-front

May 10th, 2023
734
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 1.47 KB | None | 0 0
  1. #include <iostream>
  2. #include <fstream>
  3.  
  4. using namespace std;
  5.  
  6. struct Nod
  7. {
  8.     int info;
  9.     Nod* leg;
  10. };
  11.  
  12. void afiseazaLista(Nod* head);
  13. void FAdaugaInainte(Nod*& head);
  14. int main()
  15. {
  16.     // 1,7,3,4,13, atunci la final lista va fi: 2,1,14,7,6,3,4,26,13.
  17.     Nod* head = new Nod;
  18.     head->info = 1;
  19.  
  20.     Nod* n2, * n3, *n4, * n5;
  21.     n2 = new Nod;
  22.     n2->info = 7;
  23.     n3 = new Nod;
  24.     n3->info = 3;
  25.     n4 = new Nod;
  26.     n4->info = 4;
  27.     n5 = new Nod;
  28.     n5->info = 13;
  29.  
  30.     head->leg =n2;
  31.     n2->leg = n3;
  32.     n3->leg = n4;
  33.     n4->leg = n5;
  34.     n5->leg = nullptr;https://pastebin.com/
  35.  
  36.     cout << "Inainte de adaugare: \n";
  37.     afiseazaLista(head);
  38.     cout << " Dupa adaugare: \n";
  39.     FAdaugaInainte(head);
  40.     afiseazaLista(head);
  41.     return 0;
  42. }
  43.  
  44. void afiseazaLista(Nod* head) {
  45.     Nod* temp = head;
  46.     while (temp != nullptr) {
  47.         cout << temp->info << " ";
  48.         temp = temp->leg;
  49.     }
  50. }
  51.  
  52. void FAdaugaInainte(Nod*& head) {
  53.     Nod* auxiliar = new Nod;
  54.     if (head->info % 2 == 1) {
  55.         auxiliar->info = head->info * 2;
  56.         auxiliar->leg  = head;
  57.         head = auxiliar;
  58.     }
  59.     auxiliar = head->leg;
  60.     while (auxiliar->leg != nullptr) {
  61.         if (auxiliar->leg->info % 2 == 1) {
  62.             Nod* nodNou = new Nod;
  63.             nodNou->info = auxiliar->leg->info * 2;
  64.             nodNou->leg = auxiliar->leg;
  65.             auxiliar->leg = nodNou;
  66.         }
  67.         auxiliar = auxiliar->leg;
  68.     }
  69. }
  70.  
  71.  
Advertisement
Add Comment
Please, Sign In to add comment