首页 > 其他 > 详细

LeetCode:Evaluate Reverse Polish Notation

时间:2016-06-16 14:36:10      阅读:236      评论:0      收藏:0      [点我收藏+]

Evaluate Reverse Polish Notation




Total Accepted: 66669 Total Submissions: 278014 Difficulty: Medium

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

Subscribe to see which companies asked this question

Hide Tags
 Stack




















思路:

逆波兰表达式。


java code:

public class Solution {
    public int evalRPN(String[] tokens) {
        
        Stack<Integer> stack = new Stack<>();
        int ans = 0;
        int x, y;
        for(String t : tokens) {
            switch(t){
                case "+":
                    stack.push(stack.pop() + stack.pop());
                    break;
                case "-":
                    x = stack.pop();
                    y = stack.pop();
                    stack.push(y - x);
                    break;
                case "*":
                    stack.push(stack.pop() * stack.pop());
                    break;
                case "/":
                    x = stack.pop();
                    y = stack.pop();
                    stack.push(y / x);
                    break;
                default:
                    stack.push(Integer.parseInt(t));
            }
        }
        return stack.pop();
    }
}


LeetCode:Evaluate Reverse Polish Notation

原文:http://blog.csdn.net/itismelzp/article/details/51690865

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!