c语言四则运算例题 带注释,华为面试题:四则运算 C语言源码

四则运算

描述:

请实现如下接口

/* 功能:四则运算

* 输入:strExpression:字符串格式的算术表达式,如: "3+2*{1+2*[-4/(8-6)+7]}"

* 返回:算术表达式的计算结果

*/

public static int calculate(String strExpression)

{

/* 请实现*/

return 0;

}

约束:

pucExpression字符串中的有效字符包括[‘0’-‘9’],‘+’,‘-’, ‘*’,‘/’ ,‘(’, ‘)’,‘[’, ‘]’,‘{’ ,‘}’。

pucExpression算术表达式的有效性由调用者保证;

知识点:  栈

题目来源:  内部整理

练习阶段:  中级

运行时间限制: 10Sec

内存限制: 128MByte

输入:

输入一个算术表达式

输出:

得到计算结果

样例输入:

3+2*{1+2*[-4/(8-6)+7]}

样例输出:

25

#include "stdio.h"

#include "stdlib.h"

#include "string.h"

#define MAX_PATH 256

char stack_all[MAX_PATH] = {0};

char stack_symbol[MAX_PATH] = {0};

char stack_num[MAX_PATH] = {0};

int num_all=0;

int num_symbol =0;

int num_num = 0;

int cal(int a,int b,char op)

{

switch(op)

{

case '+':

return a+b;

case '-':

return a-b;

case '*':

return a*b;

case '/':

if (b==0)

{

return 0;

}

return a/b;

default:

return 0;

}

}

//有效字符是0-9

int calculate(char *strExpression)

{

int length = strlen(strExpression);

for (int i=length-1;i>=0;i--)

{

char t = strExpression[i];

if(t=='*' || t=='/' || t==')' || t==']' || t=='}')

{

stack_symbol[num_symbol] = t;

num_symbol++;

}

else if (t=='(')

{

while(true)

{

if (stack_symbol[num_symbol-1]==')')

{

num_symbol--;

break;

}

stack_all[num_all]=stack_symbol[num_symbol-1];

num_all++;

num_symbol--;

}

}

else if (t=='[')

{

while(true)

{

if (stack_symbol[num_symbol-1]==']')

{

num_symbol--;

break;

}

stack_all[num_all]=stack_symbol[num_symbol-1];

num_all++;

num_symbol--;

}

}

else if (t=='{')

{

while(true)

{

if (stack_symbol[num_symbol-1]=='}')

{

num_symbol--;

break;

}

stack_all[num_all]=stack_symbol[num_symbol-1];

num_all++;

num_symbol--;

}

}

else if(t=='+' || t=='-')

{

while((stack_symbol[num_symbol-1]=='*' || stack_symbol[num_symbol-1]=='/') && num_symbol!=0 )

{

stack_all[num_all]=stack_symbol[num_symbol-1];

num_all++;

num_symbol--;

}

stack_symbol[num_symbol] = t;

num_symbol++;

}

else

{

stack_all[num_all] = t;

num_all++;

}

}

for (int i=num_symbol-1;i>=0;i--)

{

stack_all[num_all]=stack_symbol[i];

num_all++;

}

for (int i=0;i

{

char t = stack_all[i];

if (t>='0'&&t<='9')

{

stack_num[num_num]=t-'0';

num_num++;

}

else

{

stack_num[num_num-2] = cal(stack_num[num_num-1],stack_num[num_num-2],t);

num_num--;

}

}

return (int)stack_num[0];

}

void init(char *buffer,char *buffer2)

{

int length = strlen(buffer);

int k = 0;

for (int i=0;i

{

char t = buffer[i];

if (t=='+'||t=='-')

{

if(i>=1 && (buffer[i-1]=='(' || buffer[i-1]=='[' || buffer[i-1]=='{'))

{

//可以不使用括号

// buffer2[k]='0';

// k++;

// buffer2[k]=buffer[i];

// k++;

buffer2[k]='(';

k++;

buffer2[k]='0';

k++;

buffer2[k]=buffer[i];

k++;

buffer2[k]=buffer[i+1];

i++;

k++;

buffer2[k]=')';

k++;

}

else

{

buffer2[k]=buffer[i];

k++;

}

}

else

{

buffer2[k]=buffer[i];

k++;

}

}

}

/*

2 3

4 6

8 10

特比注意:负数需要补0为0-正数。

*/

int main()

{

int m=0,n=0;

char buffer[MAX_PATH] = {0};

gets(buffer);

//char buffer[MAX_PATH] = "3+2*{1+2*[-4/(8-6)+7]}";

char buffer2[MAX_PATH] = {0};

init(buffer,buffer2);

// printf(buffer2);

// printf("\n");

int ret = calculate(buffer2);

//printf(stack_all);

//printf("\n");

printf("%d",ret);

return 0;

}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
#include<stdio.h> #include<stdlib.h> struct four { double a; struct four *next; //定义结构体,作为链表的节点. }; void main() { double sum(void); //函数声明. 该函数返回等的计算结果. 有优先级的运算符号在函数内部先进行计算。 double sum1; printf("请输入,以 '=' 结束, 例如“ 2*2*3-2/2= ” 结果将自动保留六位有效数字\n"); sum1=sum(); printf("该等的结果为:\t%f\n\n",sum1); } double sum(void) { struct four *head,*pnew,*ptail,*p,*q; //结构体成员. char ah; double s=0,last; //last作为 pnew->a 的前一个数值. int j=1; q=(struct four *)malloc(sizeof(struct four)); scanf("%lf%c",&q->a,&ah); last=q->a; while(j==1 && ah!='=') //头节点的建立. { switch(ah) //对运算符号的优先级进行选择,优先级高的先进行计算. { case '+': j=0; continue; break; case '-': j=0; continue; break; case '*': q=(struct four *)malloc(sizeof(struct four)); scanf("%lf",&q->a); q->a=last*q->a; break; case '/': q=(struct four *)malloc(sizeof(struct four)); scanf("%lf",&q->a); q->a=last/q->a; break; default: printf("Error!\n"); //当运算符号出错时的处理. exit(0); } last=q->a; scanf("%c",&ah); } pnew=(struct four *)malloc(sizeof(struct four)); pnew->a=q->a; //将头节点的信息传递给 head 和 ptail. head=ptail=pnew; while(ah!='=') //接下来节点的建立. { pnew=(struct four *)malloc(sizeof(struct four)); scanf("%lf",&pnew->a); switch(ah) { case '*': pnew->a=last*pnew->a; break; case '/': pnew->a=last/pnew->a; break; case '+': break; case '-': pnew->a=-pnew->a;break; default: printf("Error!\n"); //当运算符号出错时的处理. exit(0); } scanf("%c",&ah); if(ah=='-' || ah=='+'|| ah=='=') //将值进行传递 ptail->next=pnew. { ptail->next=pnew; ptail=pnew; } last=pnew->a; } ptail->next=NULL; p=head; while(p!=NULL) //各个节点数值相加的结果,有优先级符号的已经先计算了. { s=s+(p->a); p=p->next; } return s; //返回运算结果. }
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值