设计一个栈，设计一个max()函数，求当前栈中的最大元素

?

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

#include <iostream> using namespace std; #define MAXSIZE 256 typedef struct stack {     int top;     int stack[MAXSIZE]; }Stack; void initStack(Stack *s) {     s->top=0; }   void push(Stack *s,int elem) {      if(s->top>MAXSIZE)          cout<<"stack is full"<<endl;      s->top++;      s->stack[s->top]=elem; } void pop(Stack *s) {     if(s->top<=0)       cout<<"stack is empty"<<endl;      s->top--; } int max(Stack s) {        int maxNum;        int temp;        maxNum=s.stack[s.top];        s.top--;        cout<<maxNum<<endl;        while(s.top>0)          {              temp=s.stack[s.top];              cout<<temp<<endl;              if(temp>maxNum)                  maxNum=temp;              pop(&s);          }        return maxNum; }   int main() {      Stack s;      int arr[]={3,6,1,8,12,5,9,21};      initStack(&s);  //初始化栈      for(int i=0;i<8;i++)            //入栈         {            push(&s,arr[i]);         }      cout<<"当前栈中最大元素为:"<<max(s)<<endl;      return 0; }