#include<stdio.h>
#include<stdlib.h>
#include "stack.h"
void display(Stack s){
if(emptyStack(s))
printf("Stack is empty!\n");
Stack tmp = initStack();
while(!emptyStack(s)){
int x = pop(s);
printf("%d\n", x);
push(tmp, x);
}printf("\n");
while(!emptyStack(tmp)){
push(s, pop(tmp));
}
}
int length(Stack s){
int cnt = 0;
Stack tmp = initStack();
while(!emptyStack(s)){
push(tmp, pop(s));
cnt++;
}
while(!emptyStack(tmp)){
push(s, pop(tmp));
}
return cnt;
}
// 1. Get the maximum element in a stack.
int maximum(Stack s){
if(emptyStack(s)){
printf("Stack is empty!\n");
return -1;
}
int max = peek(s), x;
Stack tmp = initStack();
while(!emptyStack(s)){
x = pop(s);
if(x > max)
max = x;
push(tmp, x);
}
while(!emptyStack(tmp)){
push(s, pop(tmp));
}
return max;
}
// 2. Get the average of the elements in a stack.
double average(Stack s){
if(emptyStack(s)){
printf("Stack is empty!\n");
return -1;
}
int length = 0, x;
double sum = 0;
Stack tmp = initStack();
while(!emptyStack(s)){
x = pop(s);
push(tmp, x);
sum += x;
length++;
}
while(!emptyStack(tmp)){
push(s, pop(tmp));
}
return sum / length;
}
// 3. Check if two stacks are equal.
bool isEqual(Stack s1, Stack s2){
Stack tmp1 = initStack(), tmp2 = initStack
();
bool retEqual = true;
while(!emptyStack(s1) && !emptyStack
(s2) && retEqual){
int d1 = pop(s1), d2 = pop(s2);
push(tmp1, d1);
push(tmp2, d2);
if(d1 != d2)
retEqual = false;
}
if(!emptyStack(s1) || !emptyStack(s2))
retEqual = false;
while(!emptyStack(tmp1)){
push(s1, pop(tmp1));
push(s2, pop(tmp2));
}
return retEqual;
}
// 4. Check if two stacks are reverse to each
other.
