Circular List

by Thales 2 years, 3 months ago and tagged with: C++ Circular List
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
/********************/
/* ListaCirculara.h */
/********************/
 
#ifndef LISTA_CIRCULARA
#define LISTA_CIRCULARA
 
struct nod
{
    nod *next;
    int value;
};
 
class ListaCirculara
{
    public:
        nod *HEAD;
 
        ListaCirculara();
 
        void adaugaNod(int val);
 
        void stergeNodPrim();
        void stergeNodUltim();
        void stergeNodDupa(nod *dupa);
        void stergeNod(int val);
 
        void afiseaza();
};
 
#endif
 
/**********************/
/* ListaCirculara.cpp */
/**********************/
 
#include "ListaCirculara.h"
#include <iostream>
 
using namespace std;
 
ListaCirculara::ListaCirculara(){ HEAD = NULL; }
 
void ListaCirculara::stergeNodPrim()
{
    if(HEAD == NULL)
        cout << "Lista goala!" << endl;
    else if(HEAD != NULL && HEAD -> next == HEAD)
        HEAD = NULL;
    else
    {
        nod *iter = HEAD;
        while(iter -> next != HEAD)
            iter = iter -> next;
 
        iter -> next = HEAD -> next;
        HEAD = HEAD -> next;
    }
}
 
void ListaCirculara::stergeNodUltim()
{
    if(HEAD == NULL)
        cout << "Lista goala!" << endl;
    else if(HEAD != NULL && HEAD -> next == HEAD)
        HEAD = NULL;
    else
    {
        nod *iter = HEAD;
        while(iter -> next -> next != HEAD)
            iter = iter -> next;
 
        iter -> next = HEAD;
    }
}
 
 
void ListaCirculara::adaugaNod(int val)
{
    nod *nou = new nod();
    nou -> value = val;
 
    if(HEAD == NULL)
    {
        nou -> next = nou;
        HEAD = nou;
    }
 
    else
    {
        nou -> next = HEAD;
 
        nod *iter = HEAD;
        while(iter -> next != HEAD)
            iter = iter -> next;
 
        iter -> next = nou;
    }
}
 
void ListaCirculara::afiseaza()
{
    nod *iter = HEAD;
    if(HEAD == NULL)
        cout << "Lista este goala!" << endl;
    else
        do
        {
            cout << iter -> value << " ";
            iter = iter -> next;
        }while(iter != HEAD);
}
 
void ListaCirculara::stergeNodDupa(nod *dupa)
{
    if(HEAD == NULL)
        cout << "Lista goala!" << endl;
    else if(HEAD != NULL && HEAD -> next == HEAD)
        if(HEAD -> value == dupa -> value)
            stergeNodPrim();
        else
            HEAD = NULL;
 
    else
    {
        dupa -> next = dupa -> next -> next;
    }
}
 
void ListaCirculara::stergeNod(int val)
{
    if(HEAD == NULL)
        cout << "Lista goala!" << endl;
    else if(HEAD != NULL && HEAD -> next == HEAD)
        if(HEAD -> value == val)
            stergeNodPrim();
        else
            HEAD = NULL;
 
    else
    {
        nod *iter = HEAD;
        while(iter -> next != HEAD)
        {
            if(iter -> next -> value == val)
            {
                stergeNodDupa(iter);
                break;
            }
            else
                iter = iter -> next;
        }
    }
}

Currently 0 comments

To post a comment, you must login.