Question

Write a program which takes a String input and then prints the number of times the letter p is followed by a vowel (y is not considered a vowel here). The letter p, and the vowel that follows, may be upper or lower case.

Hint - remember there are String methods which return a copy of the String it is called on with all letter characters changed to the same case.

in java

Sample run

Input String:
Peter Piper picked a pack of pickle peppers.
Contains p followed by a vowel 8 times.

Answer 1

To solve this problem, you can iterate through each character in the input String and check if the current character is 'p'. If it is, you can then check if the next character is a vowel.

Step-by-step explanation:

To solve this problem, you can iterate through each character in the input String and check if the current character is 'p'. If it is, you can then check if the next character is a vowel. You can do this by converting both characters to lowercase using the 'toLowerCase()' method and then checking if the next character is one of 'a', 'e', 'i', 'o', or 'u'.

Here is a Java implementation:

public class Main {
public static void main(String[] args) {
String input = "Peter Piper picked a pack of pickle peppers.";
int count = 0;
input = input.toLowerCase();
for (int i = 0; i < input.length() - 1; i++) {
if (input.charAt(i) == 'p' && isVowel(input.charAt(i + 1))) {
count++;
}
}
System.out.println("Contains p followed by a vowel " + count + " times.");
}

public static boolean isVowel(char c)
return c == 'a'
}

This program will output:

Contains p followed by a vowel 8 times.

The program in Java counts the instances where 'p' is followed by a vowel in a given string. It first converts the string to lowercase, then iterates through its characters to find this pattern, incrementing a counter each time the pattern is found.

The goal of the program is to count the number of times the letter p is followed by a vowel. To achieve this, we can convert the input string to lowercase to simplify the matching process. The program will iterate through the characters of the string and will use a conditional check to determine if p is followed by a vowel (a, e, i, o, u). Below is a simple Java program that implements this logic:

public class LetterPFollowedByVowelCounter {
public static void main(String[] args) {
String input = "Peter Piper picked a pack of pickle peppers.";
System.out.println("Contains p followed by a vowel " + countPFollowedByVowel(input) + " times.");
}

public static int countPFollowedByVowel(String str) {
int count = 0;
str = str.toLowerCase();
for (int i = 0; i < str.length() - 1; i++) {
if (str.charAt(i) == 'p' && "aeiou".indexOf(str.charAt(i + 1)) >= 0) {
count++;
}
}
return count;
}
}