add 2559

fishercoder1534 · fishercoder1534 · commit 24b7a6aecc4e · 2023-02-05T13:20:31.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                  
 |------|----------------|------------------------------------------------------------------------------------------------------------------------------------------|------------------------------------------------------------------------------|----------------------------------|-------------
+| 2559 |[Count Vowel Strings in Ranges](https://leetcode.com/problems/count-vowel-strings-in-ranges/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2559.java)                                                                     |                                          | Medium                           |
 | 2558 |[Take Gifts From the Richest Pile](https://leetcode.com/problems/take-gifts-from-the-richest-pile/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2558.java)                                                                     |                                          | Easy                             |
 | 2554 |[Maximum Number of Integers to Choose From a Range I](https://leetcode.com/problems/maximum-number-of-integers-to-choose-from-a-range-i/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2554.java)                                                                     |                                          | Medium                           |
 | 2553 |[Separate the Digits in an Array](https://leetcode.com/problems/separate-the-digits-in-an-array/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2553.java)                                                                     |                                          | Easy                             |
diff --git a/src/main/java/com/fishercoder/solutions/_2559.java b/src/main/java/com/fishercoder/solutions/_2559.java
@@ -0,0 +1,46 @@
+package com.fishercoder.solutions;
+
+import java.util.Arrays;
+import java.util.HashSet;
+import java.util.Set;
+
+public class _2559 {
+    public static class Solution1 {
+        public int[] vowelStrings(String[] words, int[][] queries) {
+            int[] ans = new int[queries.length];
+            boolean[] vowels = new boolean[words.length];
+            Set<Character> set = new HashSet<>(Arrays.asList('a', 'e', 'i', 'o', 'u'));
+            int i = 0;
+            for (String word : words) {
+                if (word.length() == 1) {
+                    if (set.contains(word.charAt(0))) {
+                        vowels[i] = true;
+                    }
+                } else if (set.contains(word.charAt(0)) && set.contains(word.charAt(word.length() - 1))) {
+                    vowels[i] = true;
+                }
+                i++;
+            }
+            int[] preSums = new int[words.length];
+            preSums[0] = vowels[0] == true ? 1 : 0;
+            for (int k = 1; k < words.length; k++) {
+                if (vowels[k]) {
+                    preSums[k] = preSums[k - 1] + 1;
+                } else {
+                    preSums[k] = preSums[k - 1];
+                }
+            }
+            i = 0;
+            for (int[] query : queries) {
+                int start = query[0];
+                int end = query[1];
+                if (start == 0) {
+                    ans[i++] = preSums[end];
+                } else {
+                    ans[i++] = preSums[end] - preSums[start - 1];
+                }
+            }
+            return ans;
+        }
+    }
+}
