Last active
March 31, 2019 20:43
-
-
Save def-au1t/2d76c5b74f1c7f5bb3cfa292ff9881d3 to your computer and use it in GitHub Desktop.
Stos
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include <stdio.h> | |
#include <stdlib.h> | |
#include <stdbool.h> | |
typedef struct stack { | |
int* elements; | |
int top; | |
int max_size; | |
} stack; | |
void push(stack* s, int n) { | |
if(s->top+1<s->max_size){ | |
s->top++; | |
s->elements[s->top]=n; | |
} | |
return; | |
} | |
bool is_empty(stack* s) { | |
if(s->top<0) return true; | |
else return false; | |
} | |
int pop(stack* s) { | |
if(is_empty(s)==false){ | |
int res=s->elements[s->top]; | |
s->top--; | |
return res; | |
} | |
} | |
stack* new_stack(int size) { | |
stack* s = malloc(sizeof(stack)); | |
if(size>0) s->elements = malloc(size*sizeof(int)); | |
s->top = -1; | |
s->max_size=size; | |
return s; | |
} | |
void delete_stack(stack* s) { | |
free(s->elements); | |
free(s); | |
return; | |
} | |
int main() { | |
int size; | |
scanf("%d", &size); | |
stack* s = new_stack(size); | |
for(int i=0; i<size; i++) | |
{ | |
int val; | |
scanf("%d", &val); | |
push(s, val); | |
} | |
for(int i=0; i<size; i++){ | |
printf("%d ", pop(s)); | |
} | |
delete_stack(s); | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment