这是我的数据结构课程设计，1.　　初始化两个空栈，一个是操作符栈，一个是操作数栈。2.　　如果字符是操作数，将它压入操作数栈。 如果字符是个操作符，则和运算符栈顶的运算符比较优先权后作相应操作，优先技小泽压入栈，大于则将栈顶的运算符出栈，并将运算数栈顶的两个数出栈进行运算。等于，则弹出操作符。-This is my data structure of the curriculum design, 1. Initialize two empty stacks, one stack operator, one is operand stack. 2. If the characters are operands, and place it into the operand stack pressure. If the character is an operator, the operator and operator of Top-comparison of priority after the corresponding operation, priority technical Ozawa入栈pressure than would be Top-Operators of the stack, and computing the number of Top-of carried out a stack of two the number of computing. Equivalent, then pop-up operator.