摘要： 栈#include const int max = 5;float num[max];int top = 0;void push(float x) { if (top==max){return;} num[top] = x;// top++; }void pop()... 阅读全文