feat: add solutions to lc problem: No.1190. Reverse Substrings Between Each Pair of Parentheses

Author: maolonglong

solution/1100-1199/1190.Reverse Substrings Between Each Pair of Parentheses/README.md

@@ -53,22 +53,59 @@
 
 <!-- 这里可写通用的实现逻辑 -->
 
+用双端队列或者栈，模拟反转过程
+
 <!-- tabs:start -->
 
 ### **Python3**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def reverseParentheses(self, s: str) -> str:
+        stack = []
+        for c in s:
+            if c == ")":
+                tmp = []
+                while stack[-1] != "(":
+                    tmp += stack.pop()
+                stack.pop()
+                stack += tmp
+            else:
+                stack.append(c)
+        return "".join(stack)
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
-
+class Solution {
+    public String reverseParentheses(String s) {
+        Deque<Character> deque = new ArrayDeque<>();
+        for (char c : s.toCharArray()) {
+            if (c == ')') {
+                StringBuilder sb = new StringBuilder();
+                while (deque.peekLast() != '(') {
+                    sb.append(deque.pollLast());
+                }
+                deque.pollLast();
+                for (int i = 0, n = sb.length(); i < n; i++) {
+                    deque.offerLast(sb.charAt(i));
+                }
+            } else {
+                deque.offerLast(c);
+            }
+        }
+        StringBuilder sb = new StringBuilder();
+        while (!deque.isEmpty()) {
+            sb.append(deque.pollFirst());
+        }
+        return sb.toString();
+    }
+}
 ```
 
 ### **...**

solution/1100-1199/1190.Reverse Substrings Between Each Pair of Parentheses/README_EN.md

@@ -53,18 +53,55 @@
 
 ## Solutions
 
+Use deque or stack to simulate the reversal process.
+
 <!-- tabs:start -->
 
 ### **Python3**
 
 ```python
-
+class Solution:
+    def reverseParentheses(self, s: str) -> str:
+        stack = []
+        for c in s:
+            if c == ")":
+                tmp = []
+                while stack[-1] != "(":
+                    tmp += stack.pop()
+                stack.pop()
+                stack += tmp
+            else:
+                stack.append(c)
+        return "".join(stack)
 ```
 
 ### **Java**
 
 ```java
-
+class Solution {
+    public String reverseParentheses(String s) {
+        Deque<Character> deque = new ArrayDeque<>();
+        for (char c : s.toCharArray()) {
+            if (c == ')') {
+                StringBuilder sb = new StringBuilder();
+                while (deque.peekLast() != '(') {
+                    sb.append(deque.pollLast());
+                }
+                deque.pollLast();
+                for (int i = 0, n = sb.length(); i < n; i++) {
+                    deque.offerLast(sb.charAt(i));
+                }
+            } else {
+                deque.offerLast(c);
+            }
+        }
+        StringBuilder sb = new StringBuilder();
+        while (!deque.isEmpty()) {
+            sb.append(deque.pollFirst());
+        }
+        return sb.toString();
+    }
+}
 ```
 
 ### **...**

solution/1100-1199/1190.Reverse Substrings Between Each Pair of Parentheses/Solution.java

@@ -0,0 +1,24 @@
+class Solution {
+    public String reverseParentheses(String s) {
+        Deque<Character> deque = new ArrayDeque<>();
+        for (char c : s.toCharArray()) {
+            if (c == ')') {
+                StringBuilder sb = new StringBuilder();
+                while (deque.peekLast() != '(') {
+                    sb.append(deque.pollLast());
+                }
+                deque.pollLast();
+                for (int i = 0, n = sb.length(); i < n; i++) {
+                    deque.offerLast(sb.charAt(i));
+                }
+            } else {
+                deque.offerLast(c);
+            }
+        }
+        StringBuilder sb = new StringBuilder();
+        while (!deque.isEmpty()) {
+            sb.append(deque.pollFirst());
+        }
+        return sb.toString();
+    }
+}

solution/1100-1199/1190.Reverse Substrings Between Each Pair of Parentheses/Solution.py

@@ -0,0 +1,13 @@
+class Solution:
+    def reverseParentheses(self, s: str) -> str:
+        stack = []
+        for c in s:
+            if c == ")":
+                tmp = []
+                while stack[-1] != "(":
+                    tmp += stack.pop()
+                stack.pop()
+                stack += tmp
+            else:
+                stack.append(c)
+        return "".join(stack)