Sicily 1543. Completing Brackets

#include "iostream" #include "string" #include "stack" using namespace std;/* topic Link: http://soj.sysu.edu.cn/show_ Problem.php?pid=1543&cid= main idea: First use the stack to eliminate those that have been matched, and then see how many left and right brackets in the remaining ones, each with a closing parenthesis, with an opening parenthesis on the left side of the string, and each with an opening parenthesis, Just add a right parenthesis to the right of the string */int Main () {string S;while (cin >> s) {int flag = 0;stack<char> S1;for (size_t i = 0; i < S.S Ize (); i++) {if (!s1.empty () && s1.top () = = ' [' && s[i] = = '] ') s1.pop (); Elses1.push (S[i]);} while (!s1.empty ()) {if (s1.top () = = ' [') {s + = '] '; S1.pop ();} Else{s = ' [' + S;s1.pop ();}} cout << s << endl;} return 0;}

Sicily 1543. Completing Brackets