evaluate-reverse-polish-notation

最新推荐文章于 2024-09-18 18:23:55 发布

u014011112

最新推荐文章于 2024-09-18 18:23:55 发布

阅读量366

点赞数

分类专栏： Algorithms 文章标签：算法

本文链接：https://blog.csdn.net/u014011112/article/details/50909002

版权

Algorithms 专栏收录该内容

7 篇文章 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

public class Solution {

	public int evalRPN(String[] tokens) {
		
        if(tokens.length == 0)
        	return 0;
        
        Stack<String> stack = new Stack<String>();
        int count = 0;
        while(count < tokens.length) {
        	stack.push(tokens[count]);
        	if(isOperator(stack.peek())) {
        		String operator = stack.pop();
        		String paramB = stack.pop();
        		String paramA = stack.pop();
        		
        		int result = calculate(operator, 
        				Integer.parseInt(paramA), 
        				Integer.parseInt(paramB));
        		stack.push(String.valueOf(result));
        	}
        	count++;
        }
        return Integer.parseInt(stack.pop());
	}
	
	public boolean isOperator(String str) {
		if(str.equals("+") || str.equals("-")
				|| str.equals("*") || str.equals("/"))
			return true;
		return false;
	}
	
	public int calculate(String type, int paramA, int paramB) {
		int result = 0;
		switch (type) {
		case "+":
			result = paramA + paramB;
			break;
		case "-":
			result = paramA - paramB;
			break;
		case "*":
			result = paramA * paramB;
			break;
		case "/":
			result = paramA / paramB;
			break;
		}
		return result;
	}
	
}