【LeetCode】-Evaluate Reverse Polish Notation

最新推荐文章于 2022-03-25 16:52:08 发布

笑傲1024

最新推荐文章于 2022-03-25 16:52:08 发布

阅读量207

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/xiaoao1024/article/details/39453875

版权

LeetCode 专栏收录该内容

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

/*
*解题思路：
*借助辅助栈来完成逆波兰表达式的计算
*1.遍历数组，当前字符串为数字时入栈；
*2.为算符时，弹出栈顶的两个元素，完成计算，计算结果入栈；
*3.便利完成，当栈非空时，返回栈顶元素，计算完成。
*/

public class Solution {
    public int evalRPN(String[] tokens) {
        int factor1, factor2, result=0;
		Stack<String> stack = new Stack<String>();
		int len = tokens.length;
		for( int i=0; i<len; i++ ){
			if( tokens[i].equals("+") ){
				factor1 = Integer.parseInt( stack.pop() );
				factor2 = Integer.parseInt( stack.pop() );
				result = factor1 + factor2;
				stack.push(result+"");
				
			}else if( tokens[i].equals("-") ){
				factor1 = Integer.parseInt( stack.pop() );
				factor2 = Integer.parseInt( stack.pop() );
				result = factor2 - factor1;
				stack.push(result+"");
				
			}else if( tokens[i].equals("*") ){
				factor1 = Integer.parseInt( stack.pop() );
				factor2 = Integer.parseInt( stack.pop() );
				result = factor1 * factor2;
				stack.push(result+"");
				
			}else if( tokens[i].equals("/") ){
				factor1 = Integer.parseInt( stack.pop() );
				factor2 = Integer.parseInt( stack.pop() );
				result = factor2 / factor1;
				stack.push(result+"");
				
			}else{
				stack.push( tokens[i] );
			}
		}
		
		if( !stack.isEmpty() )
			result = Integer.parseInt( stack.pop() );
		return result;    
    }
}