Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <string.h>
- using namespace std;
- struct nod {
- char oras[51];
- int temp;
- nod *urm, *ant;
- } *p, *u, *prim;
- int ok;
- void create()
- {
- p = new nod;
- prim = p;
- cout << "Oras: "; cin >> p -> oras;
- cout << "Temp: "; cin >> p -> temp;
- p -> ant = NULL;
- cout << '\n';
- while(strcmp(p -> oras, "sterge") != 0) {
- u = new nod;
- cout << "Oras: "; cin >> u -> oras;
- cout << "Temp: "; cin >> u -> temp;
- cout<<'\n';
- p -> urm = u;
- u -> ant = p;
- p = u;
- }
- u -> urm = NULL;
- }
- void afis()
- {
- p = prim;
- while ( p -> urm != NULL ) {
- if( strncmp(p -> oras, "a", 1) == 0 || strncmp(p -> oras, "A", 1) == 0)
- {
- cout << " | " <<p -> oras << " " << p -> temp << " grade |" << '\n';
- }
- p = p -> urm;
- }
- }
- void afiss()
- {
- p = prim;
- while ( p -> urm != NULL ) {
- cout << " | " <<p -> oras << " " << p -> temp << " grade |" << '\n';
- p = p -> urm;
- }
- }
- void sterge()
- {
- //int nr;
- char orr[30];
- cout<<"Stergeti orasul: ";
- cin >> orr;
- p = prim;
- nod *q;
- if(strcmp(p -> oras, orr) == 0) {
- q = p;
- p = p -> urm;
- prim = p;
- delete(q);
- p -> ant = NULL;
- }
- else {
- while( p -> urm != NULL)
- if ( strcmp(p -> oras, orr) != 0)
- p = p -> urm;
- q = p;
- p -> ant -> urm = p -> urm;
- p -> urm -> ant = p -> ant;
- delete(q);
- }
- }
- void inserare()
- {
- int nr;
- nod *q;
- q = new nod;
- p = prim;
- cout << "Oras nou: "; cin >> q -> oras;
- cout << "Temperatura: "; cin >> q -> temp;
- cout << "Dati informatia nodului dupa care se face inserarea: "; cin >> nr;
- while( p -> temp != nr ) {
- p = p -> urm;
- q -> urm = p -> urm;
- p -> urm -> ant = q;
- p -> urm = q;
- q -> ant = p;
- }
- }
- int main()
- {
- create();
- inserare();
- for(int i=0; i<5; i++) cout<<'\n';
- cout << " | Oras | " << "Temperatura |" << '\n';
- cout << " ---------------------------------" << '\n';
- afiss();
- for(int i=0; i<5; i++) cout<<'\n';
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement