1.Problem
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
2.Pre-Thought
用栈来实现,最后的结果便存于栈顶。(逆波兰表示法:http://blog.csdn.net/beiyetengqing/article/details/8066568)
3.Algorithm
3.1栈的初始化
string str[] = {"0", "3", "/"};
vector<string> vec(str, str + sizeof(str)/sizeof(string));
3.2字符串转化为数字(http://www.cplusplus.com/reference/cstdlib/atoi/?kw=atoi)
num = atoi(current.c_str());// 头文件为<cstdlib>
也可以用sscanf来实现。(http://www.cnblogs.com/luxiaoxun/archive/2012/08/03/2621803.html)
3.2判断字符是否为数字字符
if(isdigit(ch) || ch == '-' && current.size() != 1)
isdigit头文件为<locale>。
注意“-”与“-3”的区别,如果是负数,它的长度必大于1.