add 1119

fishercoder1534 · fishercoder1534 · commit 498f3de01ee6 · 2019-11-26T18:11:34.000-08:00
diff --git a/README.md b/README.md
@@ -39,6 +39,7 @@ Your ideas/fixes/algorithms are more than welcome!
 |1137|[N-th Tribonacci Number](https://leetcode.com/problems/n-th-tribonacci-number/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1137.java) | O(n) | O(n) | |Easy||
 |1122|[Relative Sort Array](https://leetcode.com/problems/relative-sort-array/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1122.java) | O(n) | O(n) | |Easy||
 |1170|[Compare Strings by Frequency of the Smallest Character](https://leetcode.com/problems/compare-strings-by-frequency-of-the-smallest-character/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1170.java) | | | |Easy||
+|1119|[Remove Vowels from a String](https://leetcode.com/problems/remove-vowels-from-a-string/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1119.java) | | | |Easy||
 |1089|[Duplicate Zeros](https://leetcode.com/problems/duplicate-zeros/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1089.java) | O(n^2) | O(1) | |Easy||
 |1079|[Letter Tile Possibilities](https://leetcode.com/problems/letter-tile-possibilities/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1079.java) | O(1) | O(1) | |Medium||
 |1078|[Occurrences After Bigram](https://leetcode.com/problems/occurrences-after-bigram/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1078.java) | O(n) | O(1) | |Easy||
diff --git a/src/main/java/com/fishercoder/solutions/_1119.java b/src/main/java/com/fishercoder/solutions/_1119.java
@@ -0,0 +1,43 @@
+package com.fishercoder.solutions;
+
+import java.util.Arrays;
+import java.util.HashSet;
+import java.util.Set;
+
+/**
+ * 1119. Remove Vowels from a String
+ *
+ * Given a string S, remove the vowels 'a', 'e', 'i', 'o', and 'u' from it, and return the new string.
+ *
+ * Example 1:
+ * Input: "leetcodeisacommunityforcoders"
+ * Output: "ltcdscmmntyfrcdrs"
+ *
+ * Example 2:
+ * Input: "aeiou"
+ * Output: ""
+ *
+ * Note:
+ * S consists of lowercase English letters only.
+ * 1 <= S.length <= 1000
+ * */
+public class _1119 {
+    public static class Solution1 {
+        public String removeVowels(String S) {
+            Set<Character> vowels = new HashSet<>(Arrays.asList('a', 'e', 'i', 'o', 'u'));
+            StringBuilder stringBuilder = new StringBuilder();
+            for (char c : S.toCharArray()) {
+                if (!vowels.contains(c)) {
+                    stringBuilder.append(c);
+                }
+            }
+            return stringBuilder.toString();
+        }
+    }
+
+    public static class Solution2 {
+        public String removeVowels(String S) {
+            return S.replaceAll("[aeiou]", "");
+        }
+    }
+}
diff --git a/src/test/java/com/fishercoder/_1119Test.java b/src/test/java/com/fishercoder/_1119Test.java
@@ -0,0 +1,34 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._1119;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static org.junit.Assert.assertEquals;
+
+public class _1119Test {
+    private static _1119.Solution1 solution1;
+    private static _1119.Solution2 solution2;
+    private static String S;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _1119.Solution1();
+        solution2 = new _1119.Solution2();
+    }
+
+    @Test
+    public void test1() {
+        S = "leetcodeisacommunityforcoders";
+        assertEquals("ltcdscmmntyfrcdrs", solution1.removeVowels(S));
+        assertEquals("ltcdscmmntyfrcdrs", solution2.removeVowels(S));
+    }
+
+    @Test
+    public void test2() {
+        S = "aeiou";
+        assertEquals("", solution1.removeVowels(S));
+        assertEquals("", solution2.removeVowels(S));
+    }
+
+}
