逆波兰表达式

//计算1-(2+3)*1+3/2=-2.5
//123+1*-32/+
#include<stdio.h>
#include<ctype.h>
#include<stdlib.h>

#define STACK_INIT_SIZE 20
#define STACKINCREMENT 10
#define MAXBUFFER 10

typedef double ElemType;
typedef struct
{
    ElemType* base;
    ElemType* top;
    int stackSize;
}sqStack;

void InitStack(sqStack* s)
{
    s->base = (ElemType *)malloc(STACK_INIT_SIZE * sizeof(ElemType));
    if(!s->base)
        exit(0);
    s->top = s->base;
    s->stackSize = STACK_INIT_SIZE;
}

void Push(sqStack* s, ElemType e)
{
    if(s->top - s->base >=s->stackSize)
    {
        s->base = (ElemType*)realloc(s->base,(s->stackSize+STACKINCREMENT) * sizeof(ElemType));
        if(!s->base)
            exit(0);
        s->top = s->base + s->stackSize;
        s->stackSize = s->stackSize + STACKINCREMENT;
    }
    *(s->top) = e;
    s->top++;
}

void Pop(sqStack* s, ElemType* e)
{
    if(s->top == s->base)
        return ;
    *e = *--(s->top);

}

int StackLen(sqStack s)
{
    return (s.top - s.base);
}


int main()
{
    sqStack s;
    char c;
    double d,e;
    char str[MAXBUFFER];
    int i = 0;
    InitStack(&s);

    printf("请按逆波兰表达式输入待计算数据,数据与运算符之间用空格隔开,以#结束:\n");
    scanf("%c",&c);
    while(c != '#')
    {
         //printf("%c",c);
        while( isdigit(c) || c == '.')
        {

            str[i++] = c;
            str[i] = '\0';
            if(i >= 10)
            {
                printf("出错,输入的单个数据过大!\n");
                return -1;
            }

             scanf("%c",&c);

             if(c == ' ')
             {
                 d = atof(str);
                 Push(&s,d);
                 i = 0;
                 break;
             }
        }

        switch(c)
        {
            case '+':
                Pop(&s,&e);
                Pop(&s,&d);
                Push(&s,d+e);
                break;
            case '-':
                Pop(&s,&e);
                Pop(&s,&d);
                Push(&s,d-e);
                break;
            case '*':
                Pop(&s,&e);
                Pop(&s,&d);
                Push(&s,d*e);
                break;
            case '/':
                Pop(&s,&e);
                Pop(&s,&d);
                if(e != 0)
                    Push(&s,d/e);
                else
                {
                    printf("\n出错:除数为0");
                    return -1;
                }
                    break;


        }
        scanf("%c",&c);
    }


    Pop(&s,&d);
    printf("\n输出的最终结果为:%f\n",d);
    return 0;
}

 

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值