java
Parameters: String inputString
The string from which vowels will be counted
Returns: Integer count of vowels
This function takes a string as an argument and counts the vowels (a, e, i, o, u) in it. Efficient implementation with O(n) complexity.
Welcome to this blog post, dear programmer. We are glad to have you here. In the steps below, you will find a clear, straightforward guide on how to create a function that counts vowels in Java. This function is a fundamental part of many larger programs and learning how to build it will definitely enhance your coding skills. Stay with us and happy learning.
In this task, we are going to create a function in Java that will count the number of vowels in a given string. This function can be very helpful when you are dealing with string manipulation or string related problem.
public class Main {
}
Firstly, we create a public method named 'countVowels', which accepts a string and returns the count of vowels. For now, our function returns zero as we have not implemented the logic yet.
public class Main {
public static int countVowels(String str) {
return 0;
}
}
Now, we are going to implement our logic to count the vowels. We will traverse through each character of the string, and check if it is a vowel. If yes, we will increase our count.
public class Main {
public static int countVowels(String str) {
int count = 0;
for (int i = 0; i < str.length(); i++) {
char ch = str.charAt(i);
if (ch == 'a' || ch == 'e' || ch == 'i' || ch == 'o' || ch == 'u') {
count++;
}
}
return count;
}
}
The above function will only count lowercase vowels. However, vowels can be uppercase as well. So, we need to modify our function to handle this case. For this, we will convert our string to all lower case and then apply the logic.
public class Main {
public static int countVowels(String str) {
int count = 0;
str = str.toLowerCase();
for (int i = 0; i < str.length(); i++) {
char ch = str.charAt(i);
if (ch == 'a' || ch == 'e' || ch == 'i' || ch == 'o' || ch == 'u') {
count++;
}
}
return count;
}
}
We have successfully created a function in Java that can count the number of vowels in a given string. It is easy to understand and efficient. Always remember, string manipulation tasks are very common in programming and having a good grip on it will help you with coding interviews and problem-solving.
Here is the final code:
public class Main {
public static int countVowels(String str) {
int count = 0;
str = str.toLowerCase();
for (int i = 0; i < str.length(); i++) {
char ch = str.charAt(i);
if (ch == 'a' || ch == 'e' || ch == 'i' || ch == 'o' || ch == 'u') {
count++;
}
}
return count;
}
}
The function uses the Counting principle in mathematics. For any given string, it iterates through each character and increments a counter if the current character is a vowel. The final counter value is the total count of vowels. This is a simple instance of Counting principle where you tracks how many times a certain event (finding a vowel in this case) occurs.
Learn more