Search

후위 표기식

Created
2021/03/23 01:58
문제 번호
1918
카테고리
자료구조

Memo

Code

제출 날짜

@4/18/2020

메모리

1988 KB

시간

0 ms
#include <iostream> #include <stack> #define endl "\n" std::string inputValue; std::stack<char> operatorStack; void input() { std::cin >> inputValue; } void solution() { for(int i = 0; i < inputValue.length(); i++) { if(inputValue[i] >= 'A' && inputValue[i] <= 'Z') { std::cout << inputValue[i]; continue; } switch(inputValue[i]) { case '+': case '-': while((!operatorStack.empty()) && (operatorStack.top() != '(')) { std::cout << operatorStack.top(); operatorStack.pop(); } operatorStack.push(inputValue[i]); break; case '*': case '/': while((!operatorStack.empty()) && (operatorStack.top() == '*' || operatorStack.top() == '/')) { std::cout << operatorStack.top(); operatorStack.pop(); } operatorStack.push(inputValue[i]); break; case '(': operatorStack.push(inputValue[i]); break; case ')': while((!operatorStack.empty()) && operatorStack.top() != '(') { std::cout << operatorStack.top(); operatorStack.pop(); } operatorStack.pop(); break; } } while(!operatorStack.empty()) { std::cout << operatorStack.top(); operatorStack.pop(); } } int main() { input(); solution(); return 0; }
C++