2024年5月21日发(作者：)
C语言编写的计算器源代码
```c
#include
#include
#include
#include
#define MAX_EXPRESSION_SIZE 100
//栈结构定义
typedef struct
int top;
double data[MAX_EXPRESSION_SIZE];
} Stack;
//初始化栈
void initStack(Stack *s)
s->top = -1;
//入栈
void push(Stack *s, double value)
if (s->top == MAX_EXPRESSION_SIZE - 1)
printf("Stack is full. Cannot push element.n");
} else
s->data[++(s->top)] = value;
}
//出栈
double pop(Stack *s)
if (s->top == -1)
printf("Stack is empty. Cannot pop element.n");
return -1;
} else
return s->data[(s->top)--];
}
//获取栈顶元素
double peek(Stack *s)
if (s->top == -1)
return -1;
} else
return s->data[s->top];
}
//判断运算符的优先级
发布者：admin，转转请注明出处：http://www.yc00.com/web/1716293556a2727147.html
评论列表（0条）