Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <fstream>
- using namespace std;
- struct Nod
- {
- int info;
- Nod* leg;
- };
- void afiseazaLista(Nod* head);
- void FAdaugaInainte(Nod*& head);
- int main()
- {
- // 1,7,3,4,13, atunci la final lista va fi: 2,1,14,7,6,3,4,26,13.
- Nod* head = new Nod;
- head->info = 1;
- Nod* n2, * n3, *n4, * n5;
- n2 = new Nod;
- n2->info = 7;
- n3 = new Nod;
- n3->info = 3;
- n4 = new Nod;
- n4->info = 4;
- n5 = new Nod;
- n5->info = 13;
- head->leg =n2;
- n2->leg = n3;
- n3->leg = n4;
- n4->leg = n5;
- n5->leg = nullptr;https://pastebin.com/
- cout << "Inainte de adaugare: \n";
- afiseazaLista(head);
- cout << " Dupa adaugare: \n";
- FAdaugaInainte(head);
- afiseazaLista(head);
- return 0;
- }
- void afiseazaLista(Nod* head) {
- Nod* temp = head;
- while (temp != nullptr) {
- cout << temp->info << " ";
- temp = temp->leg;
- }
- }
- void FAdaugaInainte(Nod*& head) {
- Nod* auxiliar = new Nod;
- if (head->info % 2 == 1) {
- auxiliar->info = head->info * 2;
- auxiliar->leg = head;
- head = auxiliar;
- }
- auxiliar = head->leg;
- while (auxiliar->leg != nullptr) {
- if (auxiliar->leg->info % 2 == 1) {
- Nod* nodNou = new Nod;
- nodNou->info = auxiliar->leg->info * 2;
- nodNou->leg = auxiliar->leg;
- auxiliar->leg = nodNou;
- }
- auxiliar = auxiliar->leg;
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment