中缀转后缀, 通过符号栈按以下规则来即可
操作符满足当前符号优先级>栈顶优先级 || 栈空时入栈, 若"("直接入栈且优先级最低, ")"则一直输出栈类元素直到"(" 并弹出括号
注意下小数和负数即可
#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define debug cout<<"debug"<<endl
mt19937 rd(time(0));
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
const double eps = 1e-8;
const double PI = 3.14159265358979323;
const int N = 2e5+10, M = 2*N, mod = 1e9+7;
const int INF = 0x3f3f3f3f;
string s;
map<string, int> mp;
void solve()
{
cin>>s;
mp["+"] = mp["-"] = 1;
mp["*"] = mp["/"] = 2;
mp["("] = 0;
vector<string> str, res;
stack<string> op;
for(int i = 0; i<s.size(); i++)
{
if(isdigit(s[i]) || ((i==0||s[i-1]=='(') && (s[i]=='+'||s[i]=='-')))
{
string num;
if(s[i]!='+') num += s[i];
while(s[i+1]=='.'|| isdigit(s[i+1]))
{
num += s[++i];
}
str.push_back(num);
}else
{
string tmp; tmp += s[i];
str.push_back(tmp);
}
}
for(int i = 0; i<str.size(); i++)
{
if(str[i].size()>1 || isdigit(str[i][0])) res.push_back(str[i]);
else
{
// 满足当前符号优先级>栈顶优先级 || 栈空时入栈, 若(直接入栈且优先级最低, )则一直输出栈类元素直到( 并弹出括号
if(str[i] == ")")
{
while(op.size() && op.top() != "(")
{
res.push_back(op.top());
op.pop();
}
op.pop();
}else{
if(op.size() == 0 || mp[str[i]] > mp[op.top()] || str[i] == "(") op.push(str[i]);
else{
while(op.size() && op.top() != "(")
{
res.push_back(op.top());
op.pop();
}
op.push(str[i]);
}
}
}
}
while(op.size())
{
res.push_back(op.top());
op.pop();
}
for(int i = 0; i<res.size(); i++) cout<<res[i]<<" \n"[i==res.size()-1];
}
int main()
{
ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
int T;
T = 1;
// cin>>T;
while(T -- )
{
solve();
}
return 0;
}