add 1371

fishercoder1534 · fishercoder1534 · commit 303c648cc0db · 2020-03-07T13:32:47.000-08:00
diff --git a/README.md b/README.md
@@ -8,6 +8,7 @@ _If you like this project, please leave me a star._ &#9733;
 
 |  #  |      Title     |   Solutions   | Video  | Difficulty  | Tag                   
 |-----|----------------|---------------|--------|-------------|-------------
+|1371|[Find the Longest Substring Containing Vowels in Even Counts](https://leetcode.com/problems/find-the-longest-substring-containing-vowels-in-even-counts/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1371.java) | |Medium||String
 |1367|[Linked List in Binary Tree](https://leetcode.com/problems/linked-list-in-binary-tree/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1367.java) | |Medium||DP, Linked List, Tree
 |1366|[Rank Teams by Votes](https://leetcode.com/problems/rank-teams-by-votes/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1366.java) | |Medium||Array, Sort
 |1365|[How Many Numbers Are Smaller Than the Current Number](https://leetcode.com/problems/how-many-numbers-are-smaller-than-the-current-number/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1365.java) | |Easy||Array, HashTable
diff --git a/src/main/java/com/fishercoder/solutions/_1371.java b/src/main/java/com/fishercoder/solutions/_1371.java
@@ -0,0 +1,71 @@
+package com.fishercoder.solutions;
+
+import java.util.HashMap;
+import java.util.Map;
+
+/**
+ * 1371. Find the Longest Substring Containing Vowels in Even Counts
+ *
+ * Given the string s, return the size of the longest substring containing each vowel an even number of times. That is, 'a', 'e', 'i', 'o', and 'u' must appear an even number of times.
+ *
+ * Example 1:
+ * Input: s = "eleetminicoworoep"
+ * Output: 13
+ * Explanation: The longest substring is "leetminicowor" which contains two each of the vowels: e, i and o and zero of the vowels: a and u.
+ *
+ * Example 2:
+ * Input: s = "leetcodeisgreat"
+ * Output: 5
+ * Explanation: The longest substring is "leetc" which contains two e's.
+ *
+ * Example 3:
+ * Input: s = "bcbcbc"
+ * Output: 6
+ * Explanation: In this case, the given string "bcbcbc" is the longest because all vowels: a, e, i, o and u appear zero times.
+ *
+ * Constraints:
+ * 1 <= s.length <= 5 x 10^5
+ * s contains only lowercase English letters.
+ * */
+public class _1371 {
+    public static class Solution1 {
+        public int findTheLongestSubstring(String s) {
+            int max = 0;
+            for (int i = 0; i < s.length(); i++) {
+                Map<Character, Integer> map = setupMap();
+                if (s.length() - i < max) {
+                    return max;
+                }
+                for (int j = i; j < s.length(); j++) {
+                    Character b = s.charAt(j);
+                    if (map.containsKey(b)) {
+                        map.put(b, map.get(b) + 1);
+                    }
+                    if (allEven(map)) {
+                        max = Math.max(max, j - i + 1);
+                    }
+                }
+            }
+            return max;
+        }
+
+        private Map<Character, Integer> setupMap() {
+            Map<Character, Integer> map = new HashMap<>();
+            map.put('a', 0);
+            map.put('e', 0);
+            map.put('i', 0);
+            map.put('o', 0);
+            map.put('u', 0);
+            return map;
+        }
+
+        private boolean allEven(Map<Character, Integer> map) {
+            for (char c : map.keySet()) {
+                if (map.get(c) % 2 != 0) {
+                    return false;
+                }
+            }
+            return true;
+        }
+    }
+}
diff --git a/src/test/java/com/fishercoder/_1371Test.java b/src/test/java/com/fishercoder/_1371Test.java
@@ -0,0 +1,37 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._1371;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static org.junit.Assert.assertEquals;
+
+public class _1371Test {
+    private static _1371.Solution1 solution1;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _1371.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertEquals(13, solution1.findTheLongestSubstring("eleetminicoworoep"));
+    }
+
+    @Test
+    public void test2() {
+        assertEquals(5, solution1.findTheLongestSubstring("leetcodeisgreat"));
+    }
+
+    @Test
+    public void test3() {
+        assertEquals(6, solution1.findTheLongestSubstring("bcbcbc"));
+    }
+
+    @Test
+    public void test4() {
+        assertEquals(1, solution1.findTheLongestSubstring("id"));
+    }
+
+}
