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

Formatted with Google Java Formatter

Browse Source
This commit is contained in:
github-actions
2021-09-22 16:29:51 +00:00
parent 2e586b7b3c
commit ce151a8bd8
1 changed files with 38 additions and 35 deletions
Download Patch File Download Diff File Expand all files Collapse all files

27
strings/CheckVowels.java
View File

@ -1,11 +1,11 @@
package strings; package strings;
/** /**
* Vowel Count is a system whereby character strings are placed in order based on the * Vowel Count is a system whereby character strings are placed in order based on the position of
* position of the characters in the conventional ordering of an alphabet. Wikipedia: * the characters in the conventional ordering of an alphabet. Wikipedia:
* https://en.wikipedia.org/wiki/Alphabetical_order * https://en.wikipedia.org/wiki/Alphabetical_order
*/ */
class CheckVowels{ class CheckVowels {
public static void main(String[] args) { public static void main(String[] args) {
assert !hasVowels("This is a strings"); assert !hasVowels("This is a strings");
assert hasVowels("Hello World"); assert hasVowels("Hello World");
@ -20,8 +20,8 @@ class CheckVowels{
* @param input a string * @param input a string
* @return {@code true} if given string has vowels, otherwise {@code false} * @return {@code true} if given string has vowels, otherwise {@code false}
*/ */
public static boolean hasVowels(String input){ public static boolean hasVowels(String input) {
if(input.matches("[AEIOUaeiou]")){ if (input.matches("[AEIOUaeiou]")) {
countVowels(input); countVowels(input);
return true; return true;
} }
@ -30,15 +30,18 @@ class CheckVowels{
/** /**
* count the number of vowels * count the number of vowels
* *
* @param input a string * @param input a string prints the count of vowels
* prints the count of vowels
*/ */
public static void countVowels(String input){ public static void countVowels(String input) {
input.toLowerCase(); input.toLowerCase();
int count=0; int count = 0;
int i=0; int i = 0;
while(i<input.length()){ while (i < input.length()) {
if(input.charAt(i)=='a' || input.charAt(i)=='e'||input.charAt(i)=='i'||input.charAt(i)=='o'||input.charAt(i)=='u' ){ if (input.charAt(i) == 'a'
|| input.charAt(i) == 'e'
|| input.charAt(i) == 'i'
|| input.charAt(i) == 'o'
|| input.charAt(i) == 'u') {
count++; count++;
} }
i++; i++;