Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- Llista<int> petits;
- Llista<int> grans;
- node_llista* n;
- n = primer_node; // per recorrer
- while(n!=NULL){
- if(n->info<=k and petits.primer_node==NULL){
- petits.primer_node = new node_llista;
- petits.primer_node->info = n->info;
- petits.primer_node->seg =NULL;
- petits.primer_node->ant = NULL;
- petits.act = petits.primer_node;
- ++petits.longitud;
- }
- else if(n->info>k and grans.primer_node==NULL){
- grans.primer_node = new node_llista;
- grans.primer_node->info = n->info;
- grans.primer_node->seg =NULL;
- grans.primer_node->ant = NULL;
- grans.act = grans.primer_node;
- ++grans.longitud;
- }
- else if(n->info<=k and petits.primer_node!=NULL){
- node_llista* aux = new node_llista;
- aux->info = n->info;
- petits.act->seg = aux;
- aux->ant = petits.act;
- aux->seg = NULL;
- petits.act = petits.act->seg;
- ++petits.longitud;
- }
- else if(n->info>k and grans.primer_node!=NULL){
- node_llista* aux = new node_llista;
- aux->info = n->info;
- grans.act->seg = aux;
- aux->ant = grans.act;
- aux->seg = NULL;
- grans.act = grans.act->seg;
- ++grans.longitud;
- }
- if(n==ultim_node){
- petits.ultim_node=petits.act;
- grans.ultim_node=grans.act;
- }
- n = n->seg;
- }
- // petits.ultim_node->seg = grans.primer_node;
- // grans.primer_node->ant = petits.ultim_node;
- // petits.ultim_node = grans.ultim_node;
- petits.concat(grans);
- cout << petits.primer_node->info << " " << petits.ultim_node << endl;
- return petits;
- }
Add Comment
Please, Sign In to add comment