机缘
https://leetcode.cn/problems/evaluate-reverse-polish-notation/description/
150. 逆波兰表达式求值
给你一个字符串数组 tokens ,表示一个根据 逆波兰表示法 表示的算术表达式。
请你计算该表达式。返回一个表示表达式值的整数。
示例 1:
输入:tokens = [“2”,“1”,“+”,“3”,“*”]
输出:9
解释:该算式转化为常见的中缀算术表达式为:((2 + 1) * 3) = 9
示例 2:
输入:tokens = [“4”,“13”,“5”,“/”,“+”]
输出:6
解释:该算式转化为常见的中缀算术表达式为:(4 + (13 / 5)) = 6
示例 3:
输入:tokens = [“10”,“6”,“9”,“3”,“+”,“-11”,““,”/“,””,“17”,“+”,“5”,“+”]
输出:22
解释:该算式转化为常见的中缀算术表达式为:
((10 * (6 / ((9 + 3) * -11))) + 17) + 5
= ((10 * (6 / (12 * -11))) + 17) + 5
= ((10 * (6 / -132)) + 17) + 5
= ((10 * 0) + 17) + 5
= (0 + 17) + 5
= 17 + 5
= 22
收获
class Solution {
public:
int evalRPN(vector<string>& tokens) {
stack<int> stk;
int n = tokens.size();
for (int i = 0; i < n; i++) {
string& token = tokens[i];
if (isNumber(token)) {
stk.push(stoi(token));
} else {
int num2 = stk.top();
stk.pop();
int num1 = stk.top();
stk.pop();
switch (token[0]) {
case '+':
stk.push(num1 + num2);
break;
case '-':
stk.push(num1 - num2);
break;
case '*':
stk.push(num1 * num2);
break;
case '/':
stk.push(num1 / num2);
break;
}
}
}
return stk.top();
}
bool isNumber(string& token) {
return !(token == "+" || token == "-" || token == "*" || token == "/");
}
};
string转化为各种数值类型
#include <iostream>
#include <string>
int main() {
std::string myString = "123";
// 转换为整数类型
int myInt = std::stoi(myString);
long myLong = std::stol(myString);
long long myLongLong = std::stoll(myString);
// 转换为浮点数类型
float myFloat = std::stof(myString);
double myDouble = std::stod(myString);
long double myLongDouble = std::stold(myString);
std::cout << "Converted values:" << std::endl;
std::cout << "int: " << myInt << std::endl;
std::cout << "long: " << myLong << std::endl;
std::cout << "long long: " << myLongLong << std::endl;
std::cout << "float: " << myFloat << std::endl;
std::cout << "double: " << myDouble << std::endl;
std::cout << "long double: " << myLongDouble << std::endl;
return 0;
}