摘要：
1.栈的顺序存储#include<stdio.h>#include<stdlib.h>#include<time.h>#define TRUE 1#define FALSE 0#define MAXSIZE 100typedef struct{ int data[MAXSIZE]; int top;}SqStack;int Push(SqStack *s,int m);int Pop(SqStack *s,int *e);int main(){ SqStack stack; stack.top=-1; int e; Push(&stack,1); P 阅读全文
