leetcode:逆波兰表达式求值

分析
典型stack
ac code
class Solution {
public:
int evalRPN(vector& tokens) {
// 考虑stack
stack s;
// for each
for(auto token: tokens) {
if(token == "+" || token == "-" || token == "*" || token == "/") {
int b = s.top();
s.pop();
int a = s.top();
s.pop();
int c;

leetcode:逆波兰表达式求值最先出现在Python成神之路。