add 1190

fishercoder1534 · fishercoder1534 · commit df4511d02274 · 2020-02-15T18:28:36.000-08:00
diff --git a/README.md b/README.md
@@ -66,6 +66,7 @@ _If you like this project, please leave me a star._ &#9733;
 |1200|[Minimum Absolute Difference](https://leetcode.com/problems/minimum-absolute-difference/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1200.java) | [:tv:](https://www.youtube.com/watch?v=mH1aEjOEjcQ)|Easy||
 |1198|[Find Smallest Common Element in All Rows](https://leetcode.com/problems/find-smallest-common-element-in-all-rows/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1198.java) | [:tv:](https://www.youtube.com/watch?v=RMiofZrTmWo)|Easy||
 |1196|[How Many Apples Can You Put into the Basket](https://leetcode.com/problems/how-many-apples-can-you-put-into-the-basket/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1196.java) | [:tv:](https://www.youtube.com/watch?v=UelshlMQNJM)|Easy||
+|1190|[Reverse Substrings Between Each Pair of Parentheses](https://leetcode.com/problems/reverse-substrings-between-each-pair-of-parentheses/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1190.java) | |Medium|Stack|
 |1189|[Maximum Number of Balloons](https://leetcode.com/problems/maximum-number-of-balloons/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1189.java) |[:tv:](https://youtu.be/LGgMZC0vj5s) |Easy||
 |1185|[Day of the Week](https://leetcode.com/problems/day-of-the-week/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1185.java) | |Easy||
 |1184|[Distance Between Bus Stops](https://leetcode.com/problems/distance-between-bus-stops/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1184.java) | [:tv:](https://www.youtube.com/watch?v=RFq7yA5iyhI)|Easy||
diff --git a/src/main/java/com/fishercoder/solutions/_1190.java b/src/main/java/com/fishercoder/solutions/_1190.java
@@ -0,0 +1,64 @@
+package com.fishercoder.solutions;
+
+import java.util.LinkedList;
+import java.util.Queue;
+import java.util.Stack;
+
+/**
+ * 1190. Reverse Substrings Between Each Pair of Parentheses
+ *
+ * You are given a string s that consists of lower case English letters and brackets.
+ * Reverse the strings in each pair of matching parentheses, starting from the innermost one.
+ * Your result should not contain any brackets.
+ *
+ * Example 1:
+ * Input: s = "(abcd)"
+ * Output: "dcba"
+ *
+ * Example 2:
+ * Input: s = "(u(love)i)"
+ * Output: "iloveu"
+ * Explanation: The substring "love" is reversed first, then the whole string is reversed.
+ *
+ * Example 3:
+ * Input: s = "(ed(et(oc))el)"
+ * Output: "leetcode"
+ * Explanation: First, we reverse the substring "oc", then "etco", and finally, the whole string.
+ *
+ * Example 4:
+ * Input: s = "a(bcdefghijkl(mno)p)q"
+ * Output: "apmnolkjihgfedcbq"
+ *
+ * Constraints:
+ * 0 <= s.length <= 2000
+ * s only contains lower case English characters and parentheses.
+ * It's guaranteed that all parentheses are balanced.
+ * */
+public class _1190 {
+    public static class Solution1 {
+        public String reverseParentheses(String s) {
+            Stack<Character> stack = new Stack<>();
+            Queue<Character> queue = new LinkedList<>();
+            for (char c : s.toCharArray()) {
+                if (c != ')') {
+                    stack.push(c);
+                } else {
+                    while (!stack.isEmpty() && stack.peek() != '(') {
+                        queue.offer(stack.pop());
+                    }
+                    if (!stack.isEmpty()) {
+                        stack.pop();//pop off the open paren
+                    }
+                    while (!queue.isEmpty()) {
+                        stack.push(queue.poll());
+                    }
+                }
+            }
+            StringBuilder sb = new StringBuilder();
+            while (!stack.isEmpty()) {
+                sb.append(stack.pop());
+            }
+            return sb.reverse().toString();
+        }
+    }
+}
diff --git a/src/test/java/com/fishercoder/_1190Test.java b/src/test/java/com/fishercoder/_1190Test.java
@@ -0,0 +1,37 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._1190;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static org.junit.Assert.assertEquals;
+
+public class _1190Test {
+    private static _1190.Solution1 solution1;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _1190.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertEquals("dcba", solution1.reverseParentheses("(abcd)"));
+    }
+
+    @Test
+    public void test2() {
+        assertEquals("iloveu", solution1.reverseParentheses("(u(love)i)"));
+    }
+
+    @Test
+    public void test3() {
+        assertEquals("leetcode", solution1.reverseParentheses("(ed(et(oc))el)"));
+    }
+
+    @Test
+    public void test4() {
+        assertEquals("apmnolkjihgfedcbq", solution1.reverseParentheses("a(bcdefghijkl(mno)p)q"));
+    }
+
+}
