Guest User

Untitled

a guest
May 20th, 2018
138
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 1.69 KB | None | 0 0
  1.     Llista<int> petits;
  2.     Llista<int> grans;
  3.     node_llista* n;
  4.     n = primer_node; // per recorrer
  5.     while(n!=NULL){
  6.       if(n->info<=k and petits.primer_node==NULL){
  7.         petits.primer_node = new node_llista;
  8.         petits.primer_node->info = n->info;
  9.         petits.primer_node->seg =NULL;
  10.         petits.primer_node->ant = NULL;
  11.         petits.act = petits.primer_node;
  12.         ++petits.longitud;
  13.       }
  14.       else if(n->info>k and grans.primer_node==NULL){
  15.         grans.primer_node = new node_llista;
  16.         grans.primer_node->info = n->info;
  17.         grans.primer_node->seg =NULL;
  18.         grans.primer_node->ant = NULL;
  19.         grans.act = grans.primer_node;
  20.         ++grans.longitud;
  21.       }
  22.       else if(n->info<=k and petits.primer_node!=NULL){
  23.         node_llista* aux = new node_llista;
  24.         aux->info = n->info;
  25.         petits.act->seg = aux;
  26.         aux->ant = petits.act;
  27.         aux->seg = NULL;
  28.         petits.act = petits.act->seg;
  29.        ++petits.longitud;
  30.       }
  31.       else if(n->info>k and grans.primer_node!=NULL){
  32.         node_llista* aux = new node_llista;
  33.         aux->info = n->info;
  34.         grans.act->seg = aux;
  35.         aux->ant = grans.act;
  36.         aux->seg = NULL;
  37.         grans.act = grans.act->seg;
  38.         ++grans.longitud;
  39.       }
  40.       if(n==ultim_node){
  41.         petits.ultim_node=petits.act;
  42.         grans.ultim_node=grans.act;
  43.       }
  44.       n = n->seg;
  45.     }
  46. //     petits.ultim_node->seg = grans.primer_node;
  47. //     grans.primer_node->ant = petits.ultim_node;
  48. //     petits.ultim_node = grans.ultim_node;
  49.     petits.concat(grans);
  50.     cout << petits.primer_node->info << " " << petits.ultim_node << endl;
  51.     return petits;
  52.   }
Add Comment
Please, Sign In to add comment