프로그래머스 수식최대화

taewooyo · taewooyo · commit 371acac0baad · 2021-01-19T20:25:06.000+09:00
diff --git a/NTW/수식 최대화.cpp b/NTW/수식 최대화.cpp
@@ -0,0 +1,54 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+long long solution(string expression) {
+    long long answer = 0;
+    vector<long long> num;
+    vector<char> exp, location;
+    string n = "";
+    
+    for(int i = 0; i < expression.size(); i++)
+    {
+        if(expression[i] == '+' || expression[i] == '-' || expression[i] == '*')
+        {
+            num.push_back(stoi(n));
+            n = "";
+            if(find(exp.begin(), exp.end(), expression[i]) == exp.end())
+                exp.push_back(expression[i]);
+            location.push_back(expression[i]);
+        }
+        else
+            n += expression[i];
+    }
+    
+    num.push_back(stoi(n));
+    sort(exp.begin(), exp.end());
+    
+    do
+    {
+        vector<long long> tmp_num = num;
+        vector<char> tmp_loc = location;
+        
+        for(int i = 0; i < exp.size(); i++) {
+            for(int j = 0; j < tmp_loc.size(); j++) {
+                if(exp[i] == tmp_loc[j]) {
+                    if(tmp_loc[j] == '+')
+                        tmp_num[j] = tmp_num[j] + tmp_num[j + 1];
+                    else if(tmp_loc[j] == '-')
+                        tmp_num[j] = tmp_num[j] - tmp_num[j + 1];
+                    else if(tmp_loc[j] == '*')
+                        tmp_num[j] = tmp_num[j] * tmp_num[j + 1];
+                    
+                    tmp_num.erase(tmp_num.begin() + j + 1);
+                    tmp_loc.erase(tmp_loc.begin() + j);
+                    j--;
+                }
+            }    
+        }
+        
+        if(answer < abs(tmp_num[0]))
+            answer = abs(tmp_num[0]);
+    } while(next_permutation(exp.begin(), exp.end()));
+    
+    return answer;
+}
