Evaluate the value of an arithmetic expression in Reverse Polish Notation.
Valid operators are +
, -
, *
, /
. Each operand may be an integer or another expression.
- Division between two integers should truncate toward zero.
- The given RPN expression is always valid. That means the expression would always evaluate to a result and there won't be any divide by zero operation.
Input: ["2", "1", "+", "3", "*"] Output: 9 Explanation: ((2 + 1) * 3) = 9
Input: ["4", "13", "5", "/", "+"] Output: 6 Explanation: (4 + (13 / 5)) = 6
Input: ["10", "6", "9", "3", "+", "-11", "*", "/", "*", "17", "+", "5", "+"] Output: 22 Explanation: ((10 * (6 / ((9 + 3) * -11))) + 17) + 5 = ((10 * (6 / (12 * -11))) + 17) + 5 = ((10 * (6 / -132)) + 17) + 5 = ((10 * 0) + 17) + 5 = (0 + 17) + 5 = 17 + 5 = 22
impl Solution {
pub fn eval_rpn(tokens: Vec<String>) -> i32 {
let mut nums: Vec<i32> = Vec::new();
for token in tokens {
if ["+", "-", "*", "/"].contains(&token.as_str()) {
let temp1 = nums.pop().unwrap();
let temp2 = nums.pop().unwrap();
match token.as_str() {
"+" => nums.push(temp2 + temp1),
"-" => nums.push(temp2 - temp1),
"*" => nums.push(temp2 * temp1),
"/" => nums.push(temp2 / temp1),
_ => (),
}
} else {
nums.push(token.parse().unwrap());
}
}
nums.pop().unwrap()
}
}