后缀表达式的求值

最新推荐文章于 2024-01-30 22:58:02 发布

JavaerRobertLi

最新推荐文章于 2024-01-30 22:58:02 发布

阅读量419

点赞数

文章标签： struct n2 c

本文链接：https://blog.csdn.net/public_friend/article/details/1880855

版权

#include<stdio.h>
#include<stdlib.h>

struct node
{
int num;
struct node *next;
};

struct node *push(int num ,struct node *p)
{
    struct node *n=(struct node*)malloc(sizeof(struct node));
    n->next=p;
    n->num=num;
    return n;
}

struct node *pop(int *num ,struct node *p)
{
    struct node *n=p->next;
    *num=p->num;
    free(p);
    return n;
}

int count(char key,int n1,int n2)
{
    switch(key)
    {
        case '+':return n1+n2;
        case '-':return n1-n2;
        case '*':return n1*n2;
        case '/':return n1/n2;
    }
}

int main()
{
    char key_b=0;
    char key=0;
    struct node *head=(struct node*)malloc(sizeof(struct node));
    struct node *p=head;
    head->next=head;

    while(key!='q')
    {
        key_b=key;
        scanf("%c",&key);
        if(key>='0' && key<='9')
        {
                if(key_b>='0' && key_b<='9')
                {
                         int num;
                         p=pop(&num,p);
                         p=push(num*10+key-'0',p);
                }
                else
                p=push(key-'0',p);
        }
        if(key=='+'||key=='-'||key=='*'||key=='/')
        {
                int n1,n2;
                p=pop(&n1,p);p=pop(&n2,p);
                p=push(count(key,n1,n2),p);
        }
        if(key=='/n')
        printf("%d/n",p->num);
    }
    return 0;
}