学习C++的成果，一个简单的四则运算计算器内核

     刚学C++不久，想练练基本功，于是编写了这个计算器，没用STL和容器，只是简单的类型和指针

 

     支持优先级运算和括号，正负数，小数。

 

     下面贴下源码吧：

   #include <stdlib.h> #include <iostream> using namespace std; typedef struct CharNode { char character; struct CharNode * next; struct CharNode * prev; }CharNode; typedef struct Operator { char * left; char * right; char op; }Operator; void addNodeEnd(CharNode * const &,CharNode * &); void insertNodeAfter(CharNode *,CharNode *); void insertNodeBefore(CharNode *,CharNode *); void deleteNodeAt(CharNode *); void nodeInit(CharNode * &); CharNode * createFormulaList(char *); void doCalculate(); CharNode * formatFormula(char *); void addBrackets( CharNode * ); bool addLeftBracket(CharNode * ); void addRightBracket(CharNode * ); double doOperator(CharNode *); double calculate(Operator *); void replaceNumber(CharNode *,double,Operator * ); int getLength(double ); CharNode * findNextOperator(CharNode *); Operator *getOperator(CharNode *); char * getLeft(CharNode *); char * getRight(CharNode *); void printList(CharNode * const &); void freeCharList(CharNode *); void freeOperator(Operator *); bool isCalculateEnd=false; double result=0; CharNode * h; int main() { doCalculate(); } void doCalculate() { char * formula=(char *)malloc(50*sizeof(char)); cout<<"Input a formula eg:1+2*3+4"<<endl; cin>>formula; CharNode * head=formatFormula(formula); h=head; cout<<"result:"<<doOperator(head)<<endl; free(formula); freeCharList(head); } CharNode * formatFormula(char * formula) { CharNode * head=createFormulaList(formula); CharNode * pcur=head->next; while(pcur->next!=NULL) { char character=pcur->character; switch (character){ case '*': addBrackets(pcur); cout<<"do *"<<endl; printList(head); break; case '/': addBrackets(pcur); cout<<"do /"<<endl; printList(head); break; default: break; } pcur=pcur->next; } pcur=head->next; while(pcur->next!=NULL) { char character=pcur->character; switch (character){ case '+': addBrackets(pcur); cout<<"do +"<<endl; printList(head); break; case '_': addBrackets(pcur); cout<<"do -"<<endl; printList(head); break; default: break; } pcur=pcur->next; } printList(head); return head; } CharNode * createFormulaList(char * formula) { CharNode * head=(CharNode *)malloc(sizeof(CharNode)); nodeInit(head); if(formula[0]=='-') { CharNode * first=(CharNode *)malloc(sizeof(CharNode)); nodeInit(first); first->character='0'; addNodeEnd(head,first); } int length=strlen(formula); for(int i=0;i<length;i++) { CharNode * node=(CharNode *)malloc(sizeof(CharNode)); nodeInit(node); if(formula[i]=='-'&&formula[i-1]!='(') { node->character='_'; addNodeEnd(head,node); } else if(formula[i]=='-'&&formula[i-1]=='(') { CharNode * first=(CharNode *)malloc(sizeof(CharNode)); CharNode * firstop=(CharNode *)malloc(sizeof(CharNode)); nodeInit(first); nodeInit(firstop); first->character='0'; firstop->character='_'; addNodeEnd(head,first); addNodeEnd(head,firstop); } else { node->character=formula[i]; addNodeEnd(head,node); } } return head; } void addBrackets(CharNode * p) { CharNode * pcur=p; bool doRight=addLeftBracket(p); if(doRight) { addRightBracket(p); } } bool addLeftBracket(CharNode * p) { CharNode * pcur=p->prev; int flag=0; bool isEnd=false; CharNode * node=(CharNode *)malloc(sizeof(CharNode)); nodeInit(node); node->character='('; while(pcur!=NULL) { char character=pcur->character; switch (character){ case ')': flag++; if(flag==0) { insertNodeAfter(pcur,node); isEnd=true; break; } break; case '(': flag--; if(flag<=0) { insertNodeAfter(pcur,node); isEnd=true; break; } break; case '*':case '/':case '+':case '_':case 'b': if(flag==0) { insertNodeAfter(pcur,node); isEnd=true; break; } break; default: break; } if(isEnd) { break; } pcur=pcur->prev; } return true; } void addRightBracket(CharNode * p) { CharNode * pcur=p->next; int flag=0; bool isEnd=false; CharNode * node=(CharNode *)malloc(sizeof(CharNode)); nodeInit(node); node->character=')'; while(pcur->next!=NULL) { char character=pcur->character; switch (character){ case ')': flag--; break; case '(': flag++; break; case '*':case '/':case '+':case '_': if(flag<=0) { insertNodeBefore(pcur,node); isEnd=true; break; } break; default: break; } if(isEnd) { break; } pcur=pcur->next; } if(!isEnd) { pcur->next=node; node->prev=pcur; } } double doOperator(CharNode * p) { CharNode * opnode=findNextOperator(p); if(opnode==NULL) { isCalculateEnd=true; return 0; } Operator * pop=getOperator(opnode); if(pop->left!=")"&&pop->right=="(") { opnode=findNextOperator(p); if(!isCalculateEnd) { doOperator(opnode); } freeOperator(pop); return result; } else if(pop->left!=")"&&pop->right!="(") { result=calculate(pop); replaceNumber(opnode,result,pop); printList(h); if(!isCalculateEnd) { doOperator(h); } freeOperator(pop); return result; } return 0; } void replaceNumber(CharNode * p,double result,Operator * op) { CharNode * pcur=p; CharNode * temp; int length=getLength(atof(op->left)); for(int i=0;i<=length;i++) { //temp=pcur; deleteNodeAt(pcur->prev); //printList(h); } pcur=p; length=getLength(atof(op->right)); for(int j=0;j<=length;j++) { deleteNodeAt(pcur->next); //printList(h); } char * cResult=(char * )malloc(getLength(result)*(sizeof(char))); memset(cResult,0,strlen(cResult)); sprintf(cResult, "%g", result); pcur=p; for(int n=0;n<strlen(cResult);n++) { CharNode * node=(CharNode *)malloc(sizeof(CharNode)); nodeInit(node); node->character=cResult[n]; insertNodeBefore(pcur,node); } pcur=p; temp=pcur; pcur=pcur->prev; deleteNodeAt(temp); temp=pcur; while(temp->prev!=NULL&&temp->prev->character!='(') { if(temp->prev->character=='+'||temp->prev->character=='_'||temp->prev->character=='*'||temp->prev->character=='/') { break; } temp=temp->prev; } while(pcur->next!=NULL&&pcur->next->character==')'&&temp->prev->character=='(') { deleteNodeAt(pcur->next); deleteNodeAt(temp->prev); } } int getLength(double num) { //cout<<"num"<<num<<endl; char *temp=(char *)malloc(10*sizeof(char)); memset(temp,0,10); sprintf(temp, "%g", num); //cout<<"temp"<<temp<<endl; int i=strlen(temp); //cout<<"length"<<i<<endl; return i; } double calculate(Operator * pop) { double left=atof(pop->left); double right=atof(pop->right); //cout<<left<<" "<<right<<endl; char op=pop->op; double result=0; switch (op){ case '+': result= left+right; break; case '_': result= left-right; break; case '*': result= left*right; break; case '/': result= left/right; break; default: break; } return result; } CharNode * findNextOperator(CharNode * p) { CharNode * pcur=p->next; while(pcur!=NULL) { char c=pcur->character; if(c=='+'||c=='_'||c=='*'||c=='/') { return pcur; } pcur=pcur->next; } return NULL; } Operator * getOperator(CharNode * p) { Operator * pop=(Operator *)malloc(sizeof(Operator)); pop->left=getLeft(p); pop->right=getRight(p); pop->op=p->character; return pop; } char * getLeft(CharNode * p) { CharNode * pcur=p->prev; char * left; if(pcur->character=='(') { cout<<pcur->character<<endl; cout<<"error get left"<<endl; } if(pcur->character==')') { left=")"; return left; } else { left=(char *)malloc(sizeof(char)); memset(left,0,sizeof(char)); left[strlen(left)]='/0'; bool isEnd=false; while(pcur->prev!=NULL) { char c=pcur->character; char * cc=(char *)malloc((strlen(left)+1)*sizeof(char)); memset(cc,0,(strlen(left)+2)*sizeof(char)); cc[0]=c; cc[strlen(cc)]='/0'; char * temp=left; switch(c){ case '*':case '/':case '+':case '_':case '(': isEnd=true; break; default: //left=(char *)realloc(left,(strlen(left)+1)*sizeof(char)); left=strcat(cc,left); free(temp); left[strlen(left)]='/0'; break; } if(isEnd) { return left; } pcur=pcur->prev; } } } char * getRight(CharNode * p) { CharNode * pcur=p->next; char * right; if(pcur->character==')') { cout<<"error get right"<<endl; } if(pcur->character=='(') { right="("; return right; } else { right=(char *)malloc(sizeof(char)); memset(right,0,sizeof(char)); right[strlen(right)]='/0'; bool isEnd=false; while(pcur!=NULL) { char c=pcur->character; char * cr=(char *)malloc(sizeof(char)); memset(cr,0,2*sizeof(char)); cr[0]=c; cr[strlen(cr)]='/0'; switch(c){ case '*':case '/':case '+':case '_':case ')': isEnd=true; break; default: right=(char *)realloc(right,(strlen(right)+1)*sizeof(char)); right=strcat(right,cr); right[strlen(right)]='/0'; break; } free(cr); if(isEnd) { return right; } pcur=pcur->next; } } } void nodeInit(CharNode * & node) { node->next=NULL; node->prev=NULL; node->character='b'; } void addNodeEnd(CharNode * const & head,CharNode * &node ) { CharNode * pcur=head; while(pcur->next!=NULL) { pcur=pcur->next; } pcur->next=node; node->prev=pcur; node->next=NULL; } void insertNodeAfter(CharNode * pcur,CharNode * node) { node->next=pcur->next; node->prev=pcur; node->next->prev=node; pcur->next=node; } void insertNodeBefore(CharNode * pcur,CharNode * node) { node->next=pcur; node->prev=pcur->prev; pcur->prev=node; node->prev->next=node; } void deleteNodeAt(CharNode * pcur) { if(pcur->next!=NULL) { pcur->prev->next=pcur->next; pcur->next->prev=pcur->prev; free(pcur); } else { pcur->prev->next=NULL; } } void printList(CharNode * const& head) { CharNode * pcur=head->next; while(pcur->next!=NULL) { cout<<pcur->character; pcur=pcur->next; } cout<<pcur->character<<endl; } void freeCharList(CharNode * head) { CharNode * pcur=head; while(pcur!=NULL) { head=pcur->next; free(pcur); pcur=head; } } void freeOperator(Operator * pop) { if(pop->left!=")") { free(pop->left); } if(pop->right!="(") { free(pop->right); } free(pop); } 

 

   运行结果：

   Input a formula eg:1+2*3+4
   (1.5-2)*(2-2.5)+(2.5+(-3.5))

   result:-0.

 

   还存在很多BUG和不足，将逐步改进。