| 1 | class Solution { |
| 2 | public int[] vowelStrings(String[] words, int[][] queries) { |
| 3 | int n = words.length; |
| 4 | int prefixSum[] = new int[n]; |
| 5 | prefixSum[0] = isVowel(words[0]); |
| 6 | for(int i=1;i<n;i++){ |
| 7 | prefixSum[i] = prefixSum[i-1] + isVowel(words[i]); |
| 8 | } |
| 9 | int m = queries.length; |
| 10 | int ans[] = new int[m]; |
| 11 | for(int i=0;i<m;i++){ |
| 12 | int l = queries[i][0]; |
| 13 | int r = queries[i][1]; |
| 14 | int res = prefixSum[r]; |
| 15 | if(l!=0){ |
| 16 | res-= prefixSum[l-1]; |
| 17 | } |
| 18 | ans[i] = res; |
| 19 | } |
| 20 | return ans; |
| 21 | } |
| 22 | |
| 23 | public int isVowel(String word){ |
| 24 | HashSet<Character> set = new HashSet<>(Arrays.asList('a','e','i','o','u')); |