Evaluate Reverse Polish Notation

Evaluate the value of an arithmetic expression in Reverse Polish Notation.

Valid operators are +-*/. Each operand may be an integer or another expression.

Some examples:

  ["2", "1", "+", "3", "*"] -> ((2 + 1) * 3) -> 9
  ["4", "13", "5", "/", "+"] -> (4 + (13 / 5)) -> 6
class Solution {
public:
    int evalRPN(vector<string> &tokens) 
    {
        stack<int> st;
        int len = tokens.size();
        int i = 0;
        int tem;
        while(i<len)
        {
            if(!isdigit(tokens[i][0])&&tokens[i].length()==1)
            {
                switch(tokens[i][0])
                {
                    case '+':
                        tem = st.top();
                        st.pop();
                        tem +=st.top();
                        st.top() = tem;
                        break;
                    case '-':
                        tem = st.top();
                        st.pop();
                        tem =st.top() - tem;
                        st.top() = tem;
                        break;
                    case '*':
                        tem = st.top();
                        st.pop();
                        tem *=st.top();
                        st.top() = tem;
                        break;
                    case '/':
                        tem = st.top();
                        st.pop();
                        tem =st.top()/tem;
                        st.top() = tem;
                        break;
                    default:
                        break;
                }
            }
            else
                {
                    tem = atoi(tokens[i].c_str());
                    st.push(tem);
                }
            i++;
        }
        return st.top();
    }
};

说明:

1. 字符串string str, 转化成c格式的操作:

str.c_str();

2. 字符串变整数,包括符号了, 负数也可以

atoi(str.c_str());

3.str可以当作数组操作


                
好的,以下是代码实现: ```c #include <stdio.h> #include <stdlib.h> #include <ctype.h> typedef struct ExpressionTree { int element; struct ExpressionTree* left_tree; struct ExpressionTree* right_tree; } ExpressionTree, *ExpressionTreeRoot; int evaluate(ExpressionTreeRoot T) { if (T->left_tree == NULL && T->right_tree == NULL) { return T->element; } else { int left_value = evaluate(T->left_tree); int right_value = evaluate(T->right_tree); switch (T->element) { case '+': return left_value + right_value; case '-': return left_value - right_value; case '*': return left_value * right_value; case '/': return left_value / right_value; default: return 0; } } } void in_fix(ExpressionTreeRoot T, bool is_root) { if (T == NULL) return; if (T->left_tree != NULL) { if (!is_root && is_leaf(T->left_tree)) { printf("("); } in_fix(T->left_tree, false); } printf("%c", T->element); if (T->right_tree != NULL) { in_fix(T->right_tree, false); if (!is_root && is_leaf(T->right_tree)) { printf(")"); } } } void reverse_polish(ExpressionTreeRoot T) { if (T == NULL) return; reverse_polish(T->left_tree); reverse_polish(T->right_tree); printf("%c", T->element); } bool is_leaf(ExpressionTreeRoot T) { return T->left_tree == NULL && T->right_tree == NULL; } int main() { ExpressionTreeRoot root = (ExpressionTree*)malloc(sizeof(ExpressionTree)); root->element = '+'; root->left_tree = (ExpressionTree*)malloc(sizeof(ExpressionTree)); root->left_tree->element = '*'; root->right_tree = (ExpressionTree*)malloc(sizeof(ExpressionTree)); root->right_tree->element = '-'; root->left_tree->left_tree = (ExpressionTree*)malloc(sizeof(ExpressionTree)); root->left_tree->left_tree->element = 3; root->left_tree->right_tree = (ExpressionTree*)malloc(sizeof(ExpressionTree)); root->left_tree->right_tree->element = 4; root->right_tree->left_tree = (ExpressionTree*)malloc(sizeof(ExpressionTree)); root->right_tree->left_tree->element = 5; root->right_tree->right_tree = (ExpressionTree*)malloc(sizeof(ExpressionTree)); root->right_tree->right_tree->element = 2; printf("Infix expression: "); in_fix(root, true); printf("\n"); printf("Reverse Polish notation: "); reverse_polish(root); printf("\n"); printf("Result: %d\n", evaluate(root)); return 0; } ``` 这个程序将建立一个如下所示的表达式树: ``` + / \ * - / \ / \ 3 4 5 2 ``` 并且提供了三个操作: - `in_fix`:以中缀方式输出表达式 - `reverse_polish`:以后缀方式输出表达式 - `evaluate`:计算整个表达式树的结果 你可以根据需要进行修改和扩展。
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值