add 1047

fishercoder1534 · fishercoder1534 · commit 186b5d9bb4d3 · 2019-05-18T20:24:00.000-07:00
diff --git a/README.md b/README.md
@@ -27,6 +27,7 @@ Your ideas/fixes/algorithms are more than welcome!
 
 |  #  |      Title     |   Solutions   | Time          | Space         | Video  | Difficulty  | Tag                   
 |-----|----------------|---------------|---------------|---------------|--------|-------------|-------------
+|1047|[Remove All Adjacent Duplicates In String](https://leetcode.com/problems/remove-all-adjacent-duplicates-in-string/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1047.java) | O(n) | O(1) | |Easy||
 |1037|[Valid Boomerang](https://leetcode.com/problems/valid-boomerang/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1037.java) | O(1) | O(1) | |Easy|Math|
 |1033|[Moving Stones Until Consecutive](https://leetcode.com/problems/moving-stones-until-consecutive/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1033.java) | O(1) | O(1) | |Easy|Math|
 |1030|[Matrix Cells in Distance Order](https://leetcode.com/problems/matrix-cells-in-distance-order/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1030.java) | O(R*C) | O(1) | |Easy|
diff --git a/src/main/java/com/fishercoder/solutions/_1047.java b/src/main/java/com/fishercoder/solutions/_1047.java
@@ -0,0 +1,39 @@
+package com.fishercoder.solutions;
+
+/**
+ * 1047. Remove All Adjacent Duplicates In String
+ *
+ * Given a string S of lowercase letters, a duplicate removal consists of choosing two adjacent and equal letters, and removing them.
+ *
+ * We repeatedly make duplicate removals on S until we no longer can.
+ *
+ * Return the final string after all such duplicate removals have been made.  It is guaranteed the answer is unique.
+ *
+ *
+ *
+ * Example 1:
+ *
+ * Input: "abbaca"
+ * Output: "ca"
+ * Explanation:
+ * For example, in "abbaca" we could remove "bb" since the letters are adjacent and equal, and this is the only possible move.
+ * The result of this move is that the string is "aaca", of which only "aa" is possible, so the final string is "ca".
+ *
+ *
+ * Note:
+ *
+ * 1 <= S.length <= 20000
+ * S consists only of English lowercase letters.*/
+public class _1047 {
+    public static class Solution1 {
+        public String removeDuplicates(String S) {
+            StringBuilder sb = new StringBuilder(S);
+            for (int i = 0; i < S.length() - 1; i++) {
+                if (S.charAt(i) == S.charAt(i + 1)) {
+                    return removeDuplicates(S.substring(0, i) + S.substring(i + 2));
+                }
+            }
+            return sb.toString();
+        }
+    }
+}
diff --git a/src/test/java/com/fishercoder/_1047Test.java b/src/test/java/com/fishercoder/_1047Test.java
@@ -0,0 +1,22 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._1047;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static org.junit.Assert.assertEquals;
+
+public class _1047Test {
+    private static _1047.Solution1 solution1;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _1047.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertEquals("ca", solution1.removeDuplicates("abbaca"));
+    }
+
+}
