19-InSange

InSange/README.md

@@ -20,4 +20,5 @@
 | 16차시 | 2024.06.28 |  그래프  | [Maximum_Total_Importance_ofRoads](https://leetcode.com/problems/maximum-total-importance-of-roads/)  | [#16](https://github.com/AlgoLeadMe/AlgoLeadMe-8/pull/63)]
 | 17차시 | 2024.06.28 |  문자열  | [Zigzag Conversion](https://leetcode.com/problems/zigzag-conversion/)  | [#17](https://github.com/AlgoLeadMe/AlgoLeadMe-8/pull/64)]
 | 18차시 | 2024.07.10 |  문자열  | [Crawler Log Folder](https://leetcode.com/problems/crawler-log-folder/)  | [#18](https://github.com/AlgoLeadMe/AlgoLeadMe-8/pull/64)]
+| 19차시 | 2024.07.13 |  스택  | [Crawler Log Folder](https://leetcode.com/problems/reverse-substrings-between-each-pair-of-parentheses/)  | [#19](https://github.com/AlgoLeadMe/AlgoLeadMe-8/pull/64)]
 ---

InSange/스택/1190_Reverse Substrings Between Each Pair of Parentheses.cpp

@@ -0,0 +1,49 @@
+#include <iostream>
+#include <stack>
+
+using namespace std;
+
+class Solution {
+public:
+    string reverseParentheses(string s) {
+        stack<char> st;
+
+        string ans;
+        string word;
+
+        ans = "";
+
+        for (char c : s)
+        {
+            if (c == ')')
+            {
+                word = "";
+                while (!st.empty() && st.top() != '(') {
+                    word += st.top();
+                    st.pop();
+                }
+                if (!st.empty())
+                {
+                    st.pop();
+                }
+                for (char w : word)
+                {
+                    st.push(w);
+                }
+            }
+            else
+            {
+                st.push(c);
+            }
+        }
+
+        while (!st.empty())
+        {
+            ans = st.top() + ans;
+            st.pop();
+        }
+
+
+        return ans;
+    }
+};