leetcode

Solution to some Leetcode problems written in C++

git clone git://git.dimitrijedobrota.com/leetcode.git

2232.cpp (828B)

0 class Solution { 1 public: 2 string minimizeResult(const string &expression) { 3 const int idx = expression.find('+'); 4 const string a = expression.substr(0, idx); 5 const string b = expression.substr(idx + 1); 6 7 int mini = INT_MAX, mi, mj; 8 for (int i = 0; i < a.size(); i++) { 9 for (int j = 1; j <= b.size(); j++) { 10 int out = (i != 0 ? stoi(a.substr(0, i)) : 1) * (j != b.size() ? stoi(b.substr(j)) : 1); 11 int in = stoi(a.substr(i)) + stoi(b.substr(0, j)); 12 if (in * out < mini) { 13 mini = in * out; 14 mi = i; 15 mj = j; 16 } 17 } 18 } 19 20 return a.substr(0, mi) + "(" + a.substr(mi) + "+" + b.substr(0, mj) + ")" + b.substr(mj); 21 ; 22 } 23 };