四则运算绝密档案

{
//弹出所有元素直到遇到左括号
while(coll2.top()!="(")
{
string ch = coll2.top();
coll3.push_back(ch);
coll1.push_back(turnString(Num[3]));
}
}
else if(!second){
t+=turnString(Num[2]);
coll1.push_back(turnString(Num[2]));
}
return t;
}
//获得符号的优先性
#include<iostream>
#include<string>
#include<stdlib.h>
#include<ctime>
#include<deque>
#include<stack>
#include<fstream>
#include<windows.h>
using namespace std;
{
char s=c[0];
if(s=='('||s==')')
return true;
else
return false;
}
string addPra(string operCharToString,int Num[],deque<string>& coll1)
}
else if(!second){
t+=turnString(Num[2])+operCharToString[2]+turnString(Num[3]);
coll1.push_back(turnString(Num[2]));
coll1.push_back(charToString(operCharToString[2]));
while(!coll2.empty())
{
string c = coll2.top();
coll3.push_back(c);
coll2.pop();
}
}
bool isRepeat(int len, int op1,int op2,int opc)//判断重复
else
{
//调用check函数，针对不同情况作出不同操作
check(c,coll2,coll3);
}
}
//如果输入结束，将coll2的元素全部弹出，加入后缀表达式中
}
}
}
//从coll中取出元素，分配元素到coll2和coll3中
void allocate(deque<string>& coll1, stack<string>& coll2, deque<string>& coll3)
{
while(!coll1.empty())
coll1.push_back(turnString(Num[3]));
}
else{
t+=operCharToString[2]+turnString(Num[3]);
coll1.push_back(charToString(operCharToString[2]));
case '/':
return 1; //如果是乘除，返回1
break;
case '(':
case ')':
return -1; //将括号设为最低优先级，因此括号不会被弹出，除非遇到右括号
coll1.push_back(")");
}
else{
t+=turnString(Num[0])+operCharToString[0];
coll1.push_back(turnString(Num[0]));
coll1.push_back(charToString(operCharToString[0]));
break;
}
}
//判断符号的优先性
void check(string c, stack<string>& coll2, deque<string>& coll3)
{
if(coll2.empty())
{
}
if(operCharToString.length()==3){
if(rand()%2==1 && !second){
t+='('+turnString(Num[2])+operCharToString[2]+turnString(Num[3])+')';
coll1.push_back("(");
{
if(op1>=R||op2>=R)
return false;
if((add[op1][op2]==9)||(mul[op1][op2]==9))
return true;
if(opc==1)
{
switch (len)
{
//一个运算符
case 3:
int N,R;
//判重数组
int **add;
int **mul;
string GetProgramDir();
string turnString(int a)
{
char turnChar[10];
sprintf(turnChar,"%d",a);
return turnChar;
check(c,coll2,coll3);
}
else
{
//如果c比栈顶符号优先级大，那将c压入coll2(操作符栈）中
coll2.push(c);
return true;
}
bool isNotNum(char c)
{
if(c=='+' || c=='-' || c=='*' || c=='/' || c=='(' || c==')')
return true;
return false;
}
//判断是否为括号
bool isPra(string c)
coll2.push(c);
return;
}
if(isPra(c))
{
if(c=="(")
coll2.push(c);
else
}
string charToString(char c)
{
string t(&c);
return t;
}
bool isNum(string c)//判断是否是数字
{
char s=c[0];
if((s=='+')||(s=='-')||(s=='/')||(s=='*')|| s=='(' || s==')') return false;
//如果c的优先性比栈顶符号小或等于，弹出栈顶元素
coll2.pop();
//并将其压入coll3（后缀表达式）中
coll3.push_back(sym);
//递归调用check,比较当前符号c与下一个栈顶符号的优先性
coll1.push_back(charToString(operCharToString[1]));
}
else{
t+=turnString(Num[1])+operCharToString[1];
coll1.push_back(turnString(Num[1]));
coll1.push_back(charToString(operCharToString[1]));
coll2.pop();
}
//当遇到左括号时，弹出但不加入coll3(后缀表达式中）
coll2.pop();
}
}
else //如果不是括号
coll1.push_back(turnString(Num[2]));
coll1.push_back(charToString(operCharToString[2]));
coll1.push_back(turnString(Num[3]));
coll1.push_back(")");
int getPri(string c)
{
switch(c[0])
{
case '+':
case '-':
return 0; //如果是加减，返回0
break;
case '*':
coll1.push_back(charToString(operCharToString[1]));
coll1.push_back(turnString(Num[2]));
coll1.push_back(")");