Houssey
Un forum unde va puteti distra si vb liber despre orice...deci va astept sa postati cat mai mult posibil :))
|
Nou pe simpatie:
andreea_bianca24 24 ani
 | Femeie
24 ani
Mures
cauta Barbat
24 - 58 ani |
|
|
HousseyReguliInregistrareLoginPozeNu sunteti logat. Lista Forumurilor Pe Tematici
|
| #1 |
|
|
//Concatenarea a 2 liste simplu inlantuite//
#include<stdio.h>
#include<conio.h>
#include<alloc.h>
struct nod
{int x;
struct nod* next;
}*l,*l1;
int n,i,x,c;
struct nod* creare()
{
struct nod* aux;int v;
l=NULL;
for(i=n;i>=1;i--)
{
aux=(struct nod* )malloc(sizeof(struct nod));
printf("Valoarea nodului %d=",i);
scanf("%d",&v);
aux->x=v;
aux->next=l;
l=aux;
}
return l;
}
void afisare()
{
struct nod* c;
printf("Lista este");
if (!l)
printf("vida");
else
{c=l;
while(c)
{
printf("%3d",c->x);
if(c->x==x);
c=c->next;
}
}
}
//adaugarea el.din prima lista//
struct nod *concat(struct nod* l,struct nod* l1)
{struct nod *c,*c1,*aux,*l2;int i=1;
l2=NULL;
for(c=l;c;c=c->next)
{l2=adaugare(l2,c->x,i);
i++;
}
//adaugarea el.din a doua lista//
for(c1=l1;c1;c1=c1->next)
{l2=adaugare(l2,c1->x,i);
i++;
}
return l2;
}
/*Metoda a-II-a a concatenarii, cand una din liste nu-si pastreaza forma
initiala si devine una finala
struct nod *concat(struct nod* l,struct nod * l1)
{struct nod *c;
for(c-l;c->next;c=c->next);
c->next=l1;
return l;
}
*/
void main()
{clrscr();
printf("Nr.de noduri=");
scanf("%d",&n);
l=creare();
printf("El.cautat=");
scanf("%d",&x);
concat(l,l1);
afisare();
getch();
}
|
|
| |
|
