Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <stdio.h>
- #include <stdlib.h>
- typedef struct liste{
- int info;
- struct L *next;
- }L;
- void aff(L *start)
- {
- L *P;
- printf("Here That List:\n");
- P=start;
- while(P!=NULL)
- {
- printf("%d\t",P->info);
- P=P->next;
- }
- printf("\n\n");
- }
- int main()
- {
- int N;
- printf("gimme N:");
- scanf("%d",&N);
- // remplissage du liste
- L *start=NULL,*P,*l;
- printf("Fill That Lis Up:\n");
- for (int a=0;a<N;a++)
- {
- P=(L *)malloc(sizeof(L));
- scanf("%d",&(P->info));
- if (a==0)
- start=P;
- else
- l->next=P;
- l=P;
- }
- l->next=NULL;
- aff(start);
- // insertion d'un element X en position P
- int x,p,a=1;
- printf("Input the number you would like to insert and its position:\n");
- scanf("%d%d",&x,&p);
- if (p==1)
- {
- P=(L*)malloc(sizeof(L));
- P->info=x;
- P->next=start;
- start=P;
- }else
- {
- P=start;
- l=start;
- while(P!= NULL && a!=p)
- {
- l=P;
- P=P->next;
- a++;
- }
- ///printf("ss %d %d",P->info,a);
- L *q=(L*)malloc(sizeof(L));
- l->next=q;
- q->info=x;
- q->next=P;
- }
- aff(start);
- // supression d'un element donnée par l'ordinateur
- printf("What element do you want to delete: ");
- scanf("%d",&x);
- if (x==start->info)
- {
- P=start;
- start=start->next;
- free(P);
- }else
- {
- P=start->next;
- l=start;
- while (P!=NULL && P->info!=x)
- {
- l=P;
- P=P->next;
- }
- if (P==NULL)
- {
- printf("The element does not exist in this list\n");
- }else {
- l->next=P->next;
- free(P);
- }
- }
- aff(start);
- // suppression des elements double
- L *q=start;
- while (q!=NULL)
- {
- P=q->next;
- l=q;
- while(P!=NULL)
- {
- if (P->info==q->info)
- {
- l->next=P->next;
- free(P);
- P=l->next;
- }else{
- l=P;
- P=P->next;
- }
- }
- q=q->next;
- }
- aff(start);
- }
Advertisement
Add Comment
Please, Sign In to add comment