Data-structures/listech.c at master · tnoumar/Data-structures · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
// le type de donnée est une structure
//le pointeur vers le debut de la liste doit etre declaré avant la declaration de structure

#include<stdio.h>
#include<stdlib.h>

typedef struct pile *pt ;
struct pile {
  int data;
  pt next;
};

int push (pt *d, int data) {
  pt aux = (pt) malloc(sizeof(struct pile));
  aux->data = data;
  aux->next = *d;
  *d = aux;
}


int pop(pt *d){
  int p= (*d)->data;
  *d=(*d)->next;
  return p;


}


int main(int argc, char const *argv[]) {
  int x; int y;
  pt deb = NULL;
  for (int i = 1; i < argc; i++) {
    switch (*argv[i]) {
      case '+':
        x=pop(&deb);
        // printf("%i\n",x );
        y=pop(&deb);
        push(&deb,x+y);
        // printf("%i\n",y);
        // printf("%i\n",TAB[sommet] );
        break;
      case '-':
        x=pop(&deb);
        y=pop(&deb);
        push(&deb,x-y);
        // printf("%i\n",TAB[sommet] );

        break;
      case '*':
        x=pop(&deb);
        y=pop(&deb);
        push(&deb,x*y);
        // printf("%i\n",TAB[sommet] );
        break;
      case '/':
        x=pop(&deb);
        y=pop(&deb);
        push(&deb,x/y);
      // printf("%i\n",TAB[sommet] );
        break;
      default:
        push(&deb,atoi(argv[i]));
        // printf("%i\n",TAB[sommet]);

      }

  }
  printf("%i\n", deb->data);
  return 0;
}