A character value (a letter from the English alphabet) A string value (string consisting of only English letters and spaces) Write a C++ program using functions to print the numbers of times the character appears in the string. The character to check in the string is case-sensitive (i.e. checking for an uppercase ‘A’ is different that checking for a lowercase ‘a’). Your solution must follow the requirements presented below: a) Do not use cout to print a message before reading the input from STDIN. b) Read the input in the main function. Note that the string value may contain spaces. c) Write a function that returns the number of times the character appears in the string. You can assume that the input from STDIN will always be valid. Input Output C Computer Science 1 this is the code I have so far #include #include using namespace std; // Write a function that returns the number of times the character appears in the string. int main() { char myChar; string myString; int result; // Call the function. result = cout << endl << “Number of times the character appears in the string = “ << result << endl; return 0;
can someone help me with this problem in C++
A character value (a letter from the English alphabet) A string value (string consisting of only English letters and spaces) Write a C++
a) Do not use cout to print a message before reading the input from STDIN.
b) Read the input in the main function. Note that the string value may contain spaces.
c) Write a function that returns the number of times the character appears in the string.
You can assume that the input from STDIN will always be valid.
| Input | Output |
|---|---|
| C Computer Science |
1 |
this is the code I have so far
#include <iostream>
#include <string>
using namespace std;
// Write a function that returns the number of times the character appears in the string.
int main()
{
char myChar;
string myString; int result;
// Call the function.
result =
cout << endl << “Number of times the character appears in the string = “ << result << endl;
return 0;
}
Trending now
This is a popular solution!
Step by step
Solved in 3 steps with 3 images
