i need help | Sololearn: Learn to code for FREE!
New course! Every coder should learn Generative AI!
Try a free lesson
0

i need help

#include <conio.h> #include <stdio.h> #include <ctype.h> #include <stdlib.h> typedef struct Pile { int donnee; struct Pile *precedent; } p; /* demande si on en veut encore*/ int encore(void) { printf("encore (O/N) ? "); return(toupper(getche())=='O'); } p init (){ Pile *p = (Pile *)malloc(sizeof *p); p->precedent=NULL; return *p; } void ajoute (void){ Pile *p; init(); int n; printf("donner votre 1er entier\n"); scanf("%d",&n); Pile *p_nouveau = (Pile *)malloc(sizeof *p_nouveau); p_nouveau->donnee=n; p_nouveau->precedent=p; while (encore()){ printf("donner un autre entier \n"); scanf("%d",&n); void empiler(Pile *p,int n); } } //empiler Pile empiler(Pile *p, int nvNombre) { Pile *nouveau = (Pile *)malloc(sizeof(nouveau)); if (not (p == NULL||nouveau == NULL)) { nouveau->donnee = nvNombre; nouveau->precedent = p; p->precedent = nouveau; } } //depiler int depiler(Pile *p) { if (p == NULL) { exit(EXIT_FAILURE); } int nombreDepile = 0; Pile *elementDepile = p->precedent; if (p != NULL && p->precedent != NULL) { nombreDepile = elementDepile->donnee; p->precedent = elementDepile->precedent; free(elementDepile); } return nombreDepile; } //affichage afficherPile(Pile *p) { while(p!=NULL){ printf("%d",p); depiler(p); printf("\n"); } } main(void){ ajoute(); afficherPile(); depiler(p); depiler(p ); afficherPile(p); }

18th May 2019, 10:46 AM
Kabil Hrichi
Kabil Hrichi - avatar
1 Answer
0
Quelle est la question en fait?
31st May 2019, 9:29 PM
Semako ADOVOHEKPE
Semako ADOVOHEKPE - avatar