摘要： 一、栈 入栈 void push(Stack *S, ElemType e) { S->elem[++S->top] = e; if (S->top>=S->capacity) { S->elem = (ElemType *) realloc(S->elem, (S->capacity+SEGMEN 阅读全文