Practice #4
Lesson 12 of 13 in Coddy's Stack - Data Structures Series #1 course.
Let's create a minimum/maximum Stack!
Challenge
EasyAdd to your Stack class from before two functions:
min- returns the minimum number in the stack currently.max- returns the maximum number in the stack currently.
Bonus: Try not to iterate over all the elements in the stack each push or pop.
Try it yourself
#include <stdio.h>
#include <string.h>
#include "stack.h"
int main() {
Stack stack;
Stack_init(&stack);
char cmd[16];
while (scanf("%15s", cmd) == 1) {
if (strcmp(cmd, "push") == 0) {
int x;
scanf("%d", &x);
Stack_push(&stack, x);
}
else if (strcmp(cmd, "pop") == 0) {
printf("%d\n", Stack_pop(&stack));
}
else if (strcmp(cmd, "top") == 0) {
printf("%d\n", Stack_top(&stack));
}
else if (strcmp(cmd, "size") == 0) {
printf("%d\n", Stack_size(&stack));
}
else if (strcmp(cmd, "min") == 0) {
printf("%d\n", Stack_min(&stack));
}
else if (strcmp(cmd, "max") == 0) {
printf("%d\n", Stack_max(&stack));
}
}
return 0;
}
All lessons in Stack - Data Structures Series #1
Practice on your own: Online C compiler