sqcx_wz.c

下面这个程序支持加+ 减- 乘* 除/ 阶乘！ 开方？ 平方^ 取模％ 等运算 支持括号和括号内优先级 可以输入负数 不过输入负数时需要用括号括上 这个程序 一定有不少 缺点 我也没有用一些表达式

/*1.文字版*/


#include<math.h>

#include<ctype.h>

#include<stdio.h>

typedef struct list

{

  double data;

  struct list *next;

}NODE;

typedef NODE *LLIST;

LLIST operater=NULL;

LLIST number=NULL;

LLIST oper=NULL;

LLIST ber=NULL;

int empty(LLIST operater)

{

  if(operater==NULL)return 1;

  else return 0;

}

LLIST stackin(LLIST operater,double b)

{

  LLIST ptr;

  ptr=(LLIST)malloc(sizeof(NODE));

  ptr->data=b;

  ptr->next=operater;

  operater=ptr;

  return operater;

}

LLIST stackout(LLIST number,double *num)

{

  LLIST ptr=number;

  if(number!=NULL)

   {

    number=number->next;

    *num=ptr->data;

    free(ptr);

    return number;

   }

}

int max(char sum)

{

   switch(sum)

   {

     case '+':

     case '-':return 2;

     case '*':

     case '%':

     case '/':return 3;

     case '(':

     case ')':return 1;

     case '!':return 4;

     case '^':return 5;

     case '?':return 4;

     default:return 0;

   }

}

double tatal(double num1,double num2,char sum)

{

  int i;

  double s;

  switch(sum)

   {

     case '+':return(num2+num1);

     case '-':return(num2-num1);

     case '*':return(num2*num1);

     case '/':return(num2/num1);

     case '%':return((int)num2%(int)num1);

     case '!':return Stairs((int)num2);

     case '?':return sqrt(num2);           /*   开方 and !和?同时出现*/

     case '^':for(i=0;i<num1;i++)

               if(i==0)s=num2;

               else s*=num2;

              return s;

   }

}

Contrary(double num1,double num2,char sum)

{

  double s;

  int i;

  switch(sum)

   {

     case '-':return(num1-num2);

     case '/':return(num1/num2);

     case '%':return((int)num1%(int)num2);

     case '^':for(i=0;i<num2;i++)

               if(i==0)s=num1;

               else s*=num1;

              return s;

   }

}

Stairs(int num2)

{

  if(num2<=1)return 1;

  else return num2*Stairs(num2-1);

}

outdata(LLIST operater)

{

  LLIST ber=operater;

  while(ber!=NULL)

   {

     printf("%lf ",ber->data);

     ber=ber->next;

   }

  printf("\n");

}

outoper(LLIST operater)

{

  LLIST oper=operater;

  while(oper!=NULL)

   {

     printf("%c",oper->data);

     oper=oper->next;

   }

  printf("\n");

}

char *filter(char *c)

{

  int j=0,i=0;

  char *s;

  while(c[i]!='\0'&&c[i]!='\n')

   {

     if(c[i]!=' '&&max(c[i])||isdigit(c[i])||c[i]=='.')

      {

       if(c[i]=='!'||c[i]=='?'){ if(isdigit(c[i-1])||c[i-1]==')')s[j++]=c[i]; }

       else if(c[i]=='.'){ if(isdigit(c[i-1]))s[j++]=c[i]; }

       else s[j++]=c[i];

      }

     i++;

   }

  s[j]='\0';

  return s;

}

Resolve(char *s,double *a,char *t)

{

  int k=1,i=0,l=0;

  while(s[i]!='\0'&&s[i]!='\n')

   {

     char p[50]={0}; int j=0;

     if(max(s[i])){ if(s[i]=='('&&s[i+1]=='-')

                           {

                             i+=2;

                             while(isdigit(s[i])||s[i]=='.')p[j++]=s[i++];

                              a[k++]=0-atof(p);

                              i++;

                           }

                           else t[l++]=s[i++];

                         }

     else {

            while(isdigit(s[i])||s[i]=='.')p[j++]=s[i++];

            a[k++]=atof(p);

          }

   }

  t[l]='\0';

  a[0]=k-1;
}

main()

{

  double k,j=0,i=0,a[50];

  double num,num1,num2,sum,kern=1;

  char b[50],c[100],*s;

  printf("please input Express type: ");

  gets(c);

  s=filter(c);

  Resolve(s,a,b);

  while(b[i]!='\0'&&b!='\n')

   {

     if(b[i]!='('){ if(kern<=a[0])number=stackin(number,a[kern++]); }

jump:if(b[i]=='!'||b[i]=='?'){ number=stackout(number,&num); number=stackin(number,tatal(0,num,b[i])); }

     else if(operater==NULL||b[i]=='(')operater=stackin(operater,(double)b[i]);

          else if(b[i]==')')

            {

              if((char)operater->data=='(')operater=stackout(operater,&sum);

              else { while((char)operater->data!='(')

               {

                 number=stackout(number,&num);

                 ber=stackin(ber,num);

                 operater=stackout(operater,&sum);

                 if(oper==NULL)oper=stackin(oper,sum);

                 else {

                        if(max((char)sum)<=max((char)oper->data)&&ber->next!=NULL)

                        {

                          ber=stackout(ber,&num1);

                          ber=stackout(ber,&num2);

                          oper=stackout(oper,&num);

                          ber=stackin(ber,tatal(num1,num2,(char)num));

                        }

                        oper=stackin(oper,sum);

                      }

               }

              number=stackout(number,&num1);

              ber=stackin(ber,num1);

              operater=stackout(operater,&sum);

              ber=stackout(ber,&num1);

              ber=stackout(ber,&num2);

              oper=stackout(oper,&num);

              if((char)num=='-'||(char)num=='/'||(char)num=='%'||(char)num=='^')number=stackin(number,Contrary(num1,num2,(char)num));

              else { number=stackin(number,tatal(num1,num2,(char)num)); /* i++; goto jump; */}

             }

            }

          else {

                 if(max(b[i])<=max((char)operater->data)&&number->next!=NULL)

                  {

                    number=stackout(number,&num1);

                    number=stackout(number,&num2);

                    operater=stackout(operater,&sum);

                    num=tatal(num1,num2,(char)sum);

                    number=stackin(number,num);

                  }

                 operater=stackin(operater,(double)b[i]);

               }

     i++;

   }

   if(kern<=a[0])number=stackin(number,a[kern]);

   while(operater!=NULL)

        {

          number=stackout(number,&num1);

          number=stackout(number,&num2);

          operater=stackout(operater,&sum);

          number=stackin(number,tatal(num1,num2,(char)sum));

        }

  for(k=0;s[k]!='\0';k++)printf("%c",s[k]);

  number=stackout(number,&num2);

  printf("=%lf\n",num2);

  printf("\nCalculation End! Thank you!\n");

  getch();

}