evaluate-reverse-polish-notation

最新推荐文章于 2019-07-22 16:22:00 发布

瓶子的罐子

最新推荐文章于 2019-07-22 16:22:00 发布

阅读量408

点赞数

分类专栏： leetcode 文章标签：栈 evaluate-reverse-pol

本文链接：https://blog.csdn.net/zh_ang_lei/article/details/52504399

版权

leetcode 专栏收录该内容

21 篇文章 0 订阅

订阅专栏

题目描述：

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

代码实现：

import java.util.ArrayList;
import java.util.List;
import java.util.Stack;

public class Solution {
	public static int evalRPN(String[] tokens){
		String operators = "+-*/";
		Stack<String> stack = new Stack<String>();
		for (String str : tokens) {
			if(!operators.contains(str)){//如果是操作数，入栈
				stack.push(str);
			}else{//如果是操作符，弹出栈顶两个元素做运算
				int a = Integer.valueOf(stack.pop());
				int b = Integer.valueOf(stack.pop());
				switch(str){
					case "+":
						stack.push(String.valueOf(a+b));
						break;
					case "-":
						stack.push(String.valueOf(b-a));
						break;
					case "*":
						stack.push(String.valueOf(a*b));
						break;
					case "/":
						stack.push(String.valueOf(b/a));
						break;
				}
			}
		}
		return Integer.valueOf(stack.pop());
	}
	public static void main(String[] args) {
		String[] tokens = new String[]{"2", "1", "+", "3", "*"};
		System.out.println(evalRPN(tokens));
	}

}