algorithm/Java
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Java.git synced 2025-07-06 17:29:31 +08:00
Code Issues Packages Projects Releases Wiki Activity

refactor: CheckVowels (#5393)

Browse Source
This commit is contained in:
Alex Klymenko
2024-08-25 22:14:33 +02:00
committed by GitHub
parent a5f57fbfde
commit 580aa0c9c5
2 changed files with 17 additions and 21 deletions
Download Patch File Download Diff File Expand all files Collapse all files

20
src/main/java/com/thealgorithms/strings/CheckVowels.java
View File

@ -1,7 +1,5 @@
package com.thealgorithms.strings;
import java.util.Arrays;
import java.util.HashSet;
import java.util.Set;
/**
@ -10,24 +8,24 @@ import java.util.Set;
* alphabet. Wikipedia: https://en.wikipedia.org/wiki/Alphabetical_order
*/
public final class CheckVowels {
private static final Set<Character> VOWELS = Set.of('a', 'e', 'i', 'o', 'u');
private CheckVowels() {
}
private static final Set<Character> VOWELS = new HashSet<>(Arrays.asList('a', 'e', 'i', 'o', 'u'));
/**
* Check if a string is has vowels or not
* Checks if a string contains any vowels.
*
* @param input a string
* @return {@code true} if given string has vowels, otherwise {@code false}
* @param input a string to check
* @return {@code true} if the given string contains at least one vowel, otherwise {@code false}
*/
public static boolean hasVowels(String input) {
if (input == null) {
if (input == null || input.isEmpty()) {
return false;
}
input = input.toLowerCase();
for (int i = 0; i < input.length(); i++) {
if (VOWELS.contains(input.charAt(i))) {
for (char c : input.toLowerCase().toCharArray()) {
if (VOWELS.contains(c)) {
return true;
}
}