N 位四则算式计算器（小数和多层括号嵌套）

 

表达式计算

1. 用vector<string> 来模拟大数（长度超过int 型整数长度）的存取和运算，初步实现了加法、减法、乘法、除法运算。
2. 其中，乘法是基于循环加发实现的，除法是基于循环减法实现的。
3. 表达式中可以嵌套多层括号，通过二叉树来实现运算符优先级的选取。

/ // // // N-bit-multi-Data Calculator 1.0 // // build by dxp123 // // N位四则运算，可计算小数，多层括号嵌套的算式 // // // / #include<iostream> #include<string> #include<vector> using namespace std; typedef struct Node// 运算符树节点 { string oper; Node * Parent; Node * Lchild; Node * Rchild; int tag;//是否为运算符 }*PNode; vector<string> OperData;//运算数记录 int index=0; int CompMax(string,string); int CToI(char); char ItoC(int); int divdot(string); int Check(string&); void Pretreat(string &); string Sub1(string,string,int); int Sub2(string,string,string&); string Sub(string,string); string Add1(string,string); int Add2(string, string,string&); string Add(string,string); string Mult(string,string); string Divider(string,string,int); int GetoperRank(char); string Divoper(string); PNode CreatBiTree(string); void CaclTree(PNode &t,void (visit) (PNode &s)); void Calcu(PNode&); void EleVisit(PNode &); void AddOperData(PNode &); void AddDataTree(PNode &t,void (visit) (PNode &s)); int main() { string ss,res,OperStr; int countoper=0; do { index=0; countoper=0; OperData.clear(); OperStr.clear(); do { cout<<"请输入正确格式的算式:"<<endl; cin>>ss; } while (!Check(ss)); OperStr=Divoper(ss); for (int i=0;i<OperStr.size();i++) { if (OperStr[i]!='('&&OperStr[i]!=')') countoper++; } if (OperData.size()==0||OperStr.size()==0||OperData.size()!=countoper+1) { cout<<"你输入的算式不正确，请重新输入！"<<endl;//输入的运算符个数 与运算数必须匹配 continue; } PNode root=CreatBiTree(OperStr); AddDataTree(root,AddOperData); for (int i=0;i<OperData.size();i++)// 循环，每次从最树底层开始一步一步向上消减，直到root CaclTree(root,EleVisit); res=root->oper; cout<<"="<<res<<endl; puts("按[enter]键继续，按任意键退出...."); _flushall(); } while (getchar()=='/n'); return 0; } int CompMax(string str1, string str2 )//比较两个数的大小（string型） { string str11,str12,str21,str22; int tag=0; if (divdot(str1)) { str11.assign(str1,0,divdot(str1)); str12.assign(str1,divdot(str1)+1,str1.size()); if (str12.empty()) str12="0";//bug correct at 2010.8.19.17:00 } else { str11=str1; str12='0'; } if (divdot(str2)) { str21.assign(str2,0, divdot(str2)); str22.assign(str2,divdot(str2)+1,str2.size()); if (str22.empty()) str22="0"; } else { str21=str2; str22="0"; } while (str1[0]=='0'&&str1.length()>1) str1.erase(0,1);//删除前面多余的0 while (str2[0]=='0'&&str2.length()>1) str2.erase(0,1);//删除前面多余的0 if (str11.size()>str21.size())//整数部分比较 { return 1; } else if (str11.size()==str21.size()) { int i=0; while (i<str11.size()&&str11[i]==str21[i]) i++; if (str11[i]>str21[i]) return 1; else if (i==str11.size()) tag=-1; else return 0; } else return 0; if (tag==-1) { if (str12>str22) return 1; else if (str12==str22) return -1;//相等 else return 0; } } inline int CToI(char s)//字符转换成数字 int { return s-48; } inline char ItoC(int s) { return s+48; } int divdot(string str)// 获得小数点的位置。从高位起 { for (int i=0;i<str.size();i++) { if (str[i]=='.') return i; else continue; } return 0; } int Check(string &str)//检查输入 是否有非数字字符和运算符 { int status=1; for (int i=0;i<str.size();i++) { if ((str[i]>='0'&&str[i]<='9')|| (str[i]=='+'||str[i]=='-'||str[i]=='*'||str[i]=='.'||str[i]=='('||str[i]==')'|| str[i]=='/')) { status=1; continue; } else return 0; } return status; } string Sub1( string str1, string str2)//整数部分减法 { string res; //计算结果串,相减两个数中最大者 string Subtrahend; //被减数，串最小者 while (str1[0]=='0'&&str1.length()>1) str1.erase(0,1);//删除前面多余的0 while (str2[0]=='0'&&str2.length()>1) str2.erase(0,1);//删除前面多余的0 if (str1==str2)//串相等，直接返回0 { return "0"; } CompMax(str1,str2)? res=str1:res=str2; CompMax(str1,str2)? Subtrahend=str2:Subtrahend=str1; string::iterator maxiter=res.end()-1; string::iterator miniter=Subtrahend.end()-1; for (;miniter>=Subtrahend.begin();miniter--,maxiter--) { if (*maxiter>=*miniter) *maxiter=ItoC(CToI(*maxiter)-CToI( *miniter)); else { *maxiter=ItoC(CToI(*maxiter)-CToI( *miniter)+10); *(maxiter-1)=ItoC( CToI(*(maxiter-1))-1); } } if (CToI(*maxiter)<0) for (;CToI(*(maxiter-1))>=0;maxiter--) { *(maxiter)=ItoC(CToI(*(maxiter))+10); *(maxiter-1)=ItoC( CToI(*(maxiter-1))-1); } while (res[0]=='0') res.erase(0,1);//删除前面多余的0 if (!CompMax(str1,str2)) res.insert(res.begin(),1,'-'); return res; } int Sub2(string s1, string s2,string & res)//小数部分减法 { int t=0,r=0,c=0; int len=0; int tem; string cc("1"); string::iterator i,j; if (s1.size()>s2.size()) { len=s1.length(); s2.insert(s2.end(),s1.size()-s2.size(),'0'); } else { s1.insert(s1.end(),s2.size()-s1.size(),'0'); len=s2.length(); } res=s1; i=s1.end()-1; j=s2.end()-1; string::iterator n=res.end()-1; for (;len>0;i--,j--,n--,len--) { t=CToI(*i)-CToI(*j)-c; c=0;//------------进位清零 if (t<0) { *n=ItoC(10+t); c=1; tem=CToI(*(n-1))-1; for (string::iterator var=n-1;tem<0&&var>=s1.begin();var--) { *var=ItoC(tem+10); tem=ItoC(CToI(*(var-1))-1); } } else *n=ItoC(t); } return c; } string Sub(string str1,string str2)//减法 { string res,res1,res2,str11,str12,str21,str22,tem; char signstr1=str1[0]; char signstr2=str2[0]; if (signstr1!='-'&&signstr2=='-') { str2.erase(str2.begin()); return Add(str1,str2); } if (signstr1=='-'&&signstr2!='-') { str1.erase(str1.begin()); res=Add(str1,str2); res.insert(0,1,'-'); return res; } if (signstr1=='-'&&signstr2=='-') { str1.erase(str1.begin()); str2.erase(str2.begin()); res=Sub(str2,str1); return res; } int signmark=0; if (!CompMax(str1,str2)) { swap(str1,str2); signmark=1; } if (divdot(str1)) { str11.assign(str1,0,divdot(str1)); str12.assign(str1,divdot(str1)+1,str1.size()); } else { str11=str1; str12="0"; } if (divdot(str2)) { str21.assign(str2,0, divdot(str2)); str22.assign(str2,divdot(str2)+1,str2.size()); } else { str21=str2; str22="0"; } res1=Sub1(str11,str21); int C=Sub2(str12,str22,res2); if (C) res1=Sub1(res1,"1"); res=res1+'.'; res+=res2; if (signmark) res.insert(0,1,'-'); return res; } string Add1(string s1,string s2)//整数部分加法 { string res; int t=0,r=0,c=0; string::iterator i=s1.end()-1; string::iterator j=s2.end()-1; if (s1.size()>s2.size()) res=s1; else res=s2; string::iterator n=res.end()-1; for (;i>=s1.begin()&&j>=s2.begin();i--,j--,n--) { t=CToI(*j)+CToI(*i)+c; c=t/10; r=t%10; *n=ItoC(r); } for (;n>res.begin()-1;n--) { t=CToI(*n)+c; c=t/10; r=t%10; *(n)=ItoC(r); } if (c) res.insert(res.begin(),1,ItoC(c)); //若进位为1，插入进位1 while (res[0]=='0') res.erase(0,1); //删除前面多余的0 return res; } int Add2(string s1, string s2,string & res)//小数部分加法 { string::iterator i,j; int t=0,r=0,c=0; int len=0; if (s1.size()>s2.size()) { i=s2.end()-1; j=s1.begin()+s2.length()-1; len=s2.length(); } else { i=s1.end()-1; j=s2.begin()+s1.length()-1; len=s1.length(); } if (s1.size()>s2.size()) res=s1; else res=s2; string::iterator n=res.begin()+len-1; for (;len>0;i--,j--,n--,len--) { t=CToI(*j)+CToI(*i)+c; c=t/10; r=t%10; *n=ItoC(r); } return c; } string Add(string str1,string str2)//加法 { string res,res1,res2,str11,str12,str21,str22,tem; char signstr1=str1[0]; char signstr2=str2[0]; if (signstr1!='-'&&signstr2=='-') { str2.erase(str2.begin()); return Sub(str1,str2); } if (signstr1=='-'&&signstr2!='-') { str1.erase(str1.begin()); res=Sub(str2,str1); res.insert(0,1,'-'); return res; } if (signstr1=='-'&&signstr2=='-') { str1.erase(str1.begin()); str2.erase(str2.begin()); res=Add(str2,str1); res.insert(0,1,'-'); return res; } if (divdot(str1)) { str11.assign(str1,0,divdot(str1)); str12.assign(str1,divdot(str1)+1,str1.size()); } else str11=str1; if (divdot(str2)) { str21.assign(str2,0, divdot(str2)); str22.assign(str2,divdot(str2)+1,str2.size()); } else str21=str2; res1=Add1(str11,str21); int C=Add2(str12,str22,res2); if (C) res1=Add1(res1,"1"); if (divdot(str1)||divdot(str2)) { res=res1+'.'; res+=res2; } else res=res1+res2; return res; } string Mult(string s1,string s2)//乘法计算 s1*s2，每一位循环做加法 { int dot1=0,dot2=0; int Countsign=0; if (s1[0]=='-') { Countsign+=1; s1.erase(0,1); } if (s2[0]=='-') { Countsign+=1; s2.erase(0,1); } if (divdot(s1)) { dot1=s1.length()-divdot(s1)-1; s1.erase(divdot(s1),1); } if (divdot(s2)) { dot2=s2.length()-divdot(s2)-1; s2.erase(divdot(s2),1); } while (s1[0]=='0'&&s1.length()>1) s1.erase(0,1);//删除前面多余的0 while (s2[0]=='0'&&s2.length()>1) s2.erase(0,1);//删除前面多余的0 if (s2=="0"||s1=="0") return "0"; int dot=dot1+dot2; string tem="0"; string res; for (int i=s2.size()-1;i>-1;i--) { for (int j=CToI(s2[i]);j>0;j--) { tem=Add1(tem,s1); } for (int t=s2.size()-1-i;t>0;t--) { tem+='0'; //补零 } res=Add1(res,tem); tem='0'; } if (dot) { if (res.length()<=dot) { res.insert(0,dot-res.length()+1, '0'); } res.insert(res.end()-dot,'.');//添加小数点 } if (Countsign==1) res.insert(0,1,'-'); return res; } string Divider(string str1,string str2 ,int w=100)// 除法 循环减法 str1/str2 { //除法运算，剔除小数点后，利循环用减法 得出每位商的值 // bug: 100/0.5=0.20 if (str1==str2) return "1"; int Countsign=0; if (str1[0]=='-') { Countsign+=1; str1.erase(str1.begin()); } if (str2[0]=='-') { Countsign+=1; str2.erase(str2.begin()); } int dot1=0,dot2=0;//小数位数 if (divdot(str1)) { //----------------------剔除 小数点后末位重复的零 while (str1[str1.length()-1]=='0') str1.erase(str1.length()-1,1);//bug correct at 2010.8.19.18:05 dot1=str1.length()-divdot(str1)-1; str1.erase(divdot(str1),1);//剔除小数点 } if (divdot(str2)) { //----------------------剔除 小数点后末位重复的零 while (str2[str2.length()-1]=='0') str2.erase(str2.length()-1,1);//bug correct at 2010.8.19.18:05 dot2=str2.length()-divdot(str2)-1; str2.erase(divdot(str2),1); } //--------调试用 //cout<<str1<<"----"<<dot1<<endl; // cout<<str2<<"----"<<dot2<<endl; //------------ while (str1[0]=='0'&&str1.length()>1) str1.erase(0,1);//删除前面多余的0 while (str2[0]=='0'&&str2.length()>1) str2.erase(0,1);//删除前面多余的0 if (str2=="0") { cout<<"error:除数不能为零！"<<endl; exit(0); } if (str2=="0") return "0"; string tem(str1,0,str2.size()); string res; int j=0; int i=0;//每一位商的值 int don=0; int len=str2.size(); do { i=0; for (;CompMax(tem,str2);i++) { tem=Sub1(tem,str2); } res+=ItoC(i); if (len>=str1.size()&&tem=="0") break; if (len<str1.size()) { if (tem=="0") tem.clear();//debug correct at 2010.8.19.17:53 tem+=str1[len];//取下一位 } else { if (don==0) { don=res.length(); } tem+='0'; } i=0; len++; j++;//位数控制 } while (j<w); int dot=dot2-dot1; if (dot>0) { if (dot>=res.length()-don) res.insert(res.end(),dot-don+1, '0'); don=dot+don; } if (dot<0) { if (-dot>=don) { res.insert(0,-dot-don+1, '0'); don=-1; } else don=don+dot; } if (don==-1) res.insert(1,1, '.'); else if (don) res.insert(don,1, '.'); if (res[1]!='.'||divdot(res)==0) while (res[0]=='0'&&res.length()>1) res.erase(0,1);//删除前面多余的0 if (Countsign==1) res.insert(0,1,'-'); return res; } int GetoperRank(char s) { if (s=='+'||s=='-') return 1; else if (s=='*'||s=='/') return 2; else if (s=='(') return 3; else if (s==')') return 4; } void Pretreat(string &str) //预处理 { while (str[0]=='('&&str[str.length()-1]==')') { str.erase(0,1); str.erase(str.length()-1,1); } for (int i=0;i<str.length();i++) if (str[i]=='('&&str[i+1]=='-')//负号处理 { str[i+1]='</p> <hr> <p><br></p> <p><br></p>; str.erase(i,1); int j=i+1; for (;str[j]!=')'&&j<str.length();j++) ; str.erase(j,1); } } string Divoper(string str)// 分离运算法符和运算数 { Pretreat(str); int j=0,m=-1,i=0; string tmp,OperStr; for (;i<str.length();i++,j++) { if (str[i]=='+'||str[i]=='-'||str[i]=='*'||str[i]=='/'||str[i]=='('||str[i]==')') { tmp.assign(str,m+1,j); if (tmp[0]=='</p> <hr> <p><br></p> <p><br></p>) tmp[0]='-'; if (!tmp.empty()) OperData.push_back(tmp); OperStr+=str[i]; m=i; j=-1; } } tmp.assign(str,m+1,i-m); if (tmp[0]=='</p> <hr> <p><br></p> <p><br></p>) tmp[0]='-'; if (!tmp.empty()) OperData.push_back(tmp); return OperStr; } PNode CreatBiTree(string OperStr) // 用二叉树构造运算符优先级之间的关系，优先级越大，越靠近叶子， { int tmpRank=0; int Rank=0; PNode sp=NULL; PNode tmp=NULL; for (int i=0;i<OperStr.length();i++) { Rank=GetoperRank(OperStr[i]); if (Rank<3) { PNode OperNode=new Node; if (Rank<=tmpRank) { if (tmp->Parent&& Rank>GetoperRank(tmp->Parent->oper[0])) //GetOperrank(tmp->parent)<rank<tmprank { OperNode->oper=OperStr[i]; tmp->Parent->Rchild=OperNode; OperNode->Parent=tmp->Parent; OperNode->Lchild=tmp; tmp=OperNode; tmpRank=Rank; OperNode->tag=1; OperNode->Rchild=NULL; } else//rank<2 { if (tmp) { while (tmp->Parent) tmp=tmp->Parent; tmp->Parent=OperNode; } OperNode->oper=OperStr[i]; OperNode->Parent=NULL; OperNode->Lchild=tmp; OperNode->Rchild=NULL; tmp=OperNode; tmpRank=Rank; OperNode->tag=1; } } else { PNode OperNode=new Node; if (tmp) tmp->Rchild=OperNode; OperNode->oper=OperStr[i]; OperNode->Parent=tmp; OperNode->Lchild=NULL; OperNode->Rchild=NULL; OperNode->tag=1; tmp=OperNode; tmpRank=Rank; } } if (Rank==3) { string sstr; int j=OperStr.length()-1; for (;OperStr[j]!=')';j--) ; sstr.assign(OperStr,i+1,j-i-1); sp=CreatBiTree(sstr); if (tmp) tmp->Rchild=sp; sp->Parent=tmp; i=j; tmp=sp; tmpRank=Rank; } } while (tmp->Parent) tmp=tmp->Parent; return tmp; } void Calcu(PNode &OperNode)//选取运算符 { string Oper=OperNode->oper; string Data1=OperNode->Lchild->oper; string Data2=OperNode->Rchild->oper; string res; switch (Oper[0]) { case '+': res=Add(Data1,Data2); break; case '-': res=Sub(Data1,Data2); break; case '*': res=Mult(Data1,Data2); break; case '/': res=Divider(Data1,Data2); break; default: cout<<"Have no the operation!------>"<<Oper<<endl; } OperNode->oper=res; OperNode->tag=0; delete OperNode->Lchild; delete OperNode->Rchild; OperNode->Lchild=NULL; OperNode->Rchild=NULL; } void EleVisit(PNode &s)//运算叶子节点上的两个数 { if (s->tag==1&&s->Lchild->tag==0&&s->Rchild->tag==0) { Calcu(s); } } void AddDataTree(PNode &t,void (visit) (PNode &s)) { //后序遍历 if (t) { AddDataTree(t->Lchild,visit); visit(t); AddDataTree(t->Rchild,visit); } } void AddOperData(PNode &s)// 向由运算符构造的树上添加运算数，构成叶子 { if (s->tag==1) { if (!s->Lchild) { PNode t=new Node; t->oper=OperData[index++]; t->Parent=s; t->Lchild=NULL; t->Rchild=NULL; t->tag=0; s->Lchild=t; } if (!s->Rchild) { PNode v=new Node; v->Parent=s; v->Lchild=NULL; v->Rchild=NULL; v->oper=OperData[index++]; v->tag=0; s->Rchild=v; } } } void CaclTree(PNode &t,void (visit) (PNode &s))// 由叶子向上 遍历运算 { //后序遍历 if (t) { CaclTree(t->Lchild,visit); CaclTree(t->Rchild,visit); visit(t); } }  

 

个人感觉用string来模拟大数运算效率有点低，但是string内的char 型只有一个字节，占用较小 的存取空间。