Evaluate Reverse Polish Notation 求RPN的值@LeetCode
来源:互联网 发布:在线播放视频网站源码 编辑:程序博客网 时间:2024/06/05 18:04
用一个Stack就很容易做到了,这道题的最大发现是:这道题是2013-11-27发布出来的,到今天,短短半个月内,居然提交量快到了1万!!!
居然有这么多人都在刷题!!压力山大!
package Level3;import java.util.Stack;/** * * Evaluate Reverse Polish Notation * * 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)) -> 6Discuss * */public class S142 {public static void main(String[] args) {String[] tokens = {"4", "13", "5", "/", "+"};System.out.println(evalRPN(tokens));}public static int evalRPN(String[] tokens) { Stack<String> stack = new Stack<String>(); for(int i=0; i<tokens.length; i++){ if(tokens[i].equals("+")){ int val = Integer.parseInt(stack.pop()) + Integer.parseInt(stack.pop()); stack.push(String.valueOf(val)); }else if(tokens[i].equals("-")){ int v1 = Integer.parseInt(stack.pop()); int v2 = Integer.parseInt(stack.pop()); int val = v2 - v1; stack.push(String.valueOf(val)); }else if(tokens[i].equals("*")){ int val = Integer.parseInt(stack.pop()) * Integer.parseInt(stack.pop()); stack.push(String.valueOf(val)); }else if(tokens[i].equals("/")){ int v1 = Integer.parseInt(stack.pop()); int v2 = Integer.parseInt(stack.pop()); int val = v2 / v1; stack.push(String.valueOf(val)); }else{ stack.push(tokens[i]); } } return Integer.parseInt(stack.pop()); }}
现在的提交量超过10万!
import java.util.*;public class Solution { public int evalRPN(String[] tokens) { Stack<String> stack = new Stack<String>(); for(String s : tokens) { if(s.equals("+") || s.equals("-") || s.equals("*") || s.equals("/")) { int second = Integer.parseInt(stack.pop()); int first = Integer.parseInt(stack.pop()); if(s.equals("+")) { stack.push(String.valueOf(first+second)); } else if(s.equals("-")) { stack.push(String.valueOf(first-second)); } else if(s.equals("*")) { stack.push(String.valueOf(first*second)); } else if(s.equals("/")) { stack.push(String.valueOf(first/second)); } } else { stack.push(s); } } return Integer.parseInt(stack.pop()); }}
0 0
- Evaluate Reverse Polish Notation 求RPN的值@LeetCode
- LeetCode OJ 之 Evaluate Reverse Polish Notation (求逆波兰表达式的值)
- Evaluate Reverse Polish Notation | leetcode
- leetcode-Evaluate Reverse Polish Notation
- Leetcode: Evaluate Reverse Polish Notation
- LeetCode - Evaluate Reverse Polish Notation
- LeetCode | Evaluate Reverse Polish Notation
- Leetcode: Evaluate Reverse Polish Notation
- Leetcode: Evaluate Reverse Polish Notation
- Evaluate Reverse Polish Notation (LeetCode)
- leetcode: Evaluate Reverse Polish Notation
- Leetcode Evaluate Reverse Polish Notation
- [LeetCode] Evaluate Reverse Polish Notation
- [LeetCode] Evaluate Reverse Polish Notation
- Evaluate Reverse Polish Notation -- LeetCode
- 【LeetCode】Evaluate Reverse Polish Notation
- LeetCode-Evaluate Reverse Polish Notation
- LeetCode:Evaluate Reverse Polish Notation
- DX视图变换
- Xcode中常用的快捷键
- oracle在plaql中创建用户并授权
- 手把手教你mysql(十三)mysql常用函数
- 早晨的天马行空
- Evaluate Reverse Polish Notation 求RPN的值@LeetCode
- A Ten-Dollar Bill
- 25道常见算法面试题
- 地铁女被摸胸10分钟
- vs2013编译opencv2.4.7错误解决办法
- Boost 之 lexical_cast
- 探访北京蝈蝈市场:每月能卖10万条
- 从输入网址到显示网页的过程分析
- UvaOJ——111 History Grading