题解 | #字符串最后一个单词的长度#
计算某字母出现次数
http://www.nowcoder.com/practice/a35ce98431874e3a820dbe4b2d0508b1
#include <iostream>
#include <string>
using namespace std;
int main()
{
int count_len, count_num;
char input_string[500], selected_letter[500];
count_len = 0;
count_num = 0;
cin .getline (input_string,500);
cin >> selected_letter;
cout << selected_letter[0]<< endl ;
//cout << selected_letter << endl;
while (input_string[count_len] != 0)
{
if ((input_string[count_len] == selected_letter[0])||
(input_string[count_len] == selected_letter[0]+32)||
(input_string[count_len] == selected_letter[0] - 32))
{
count_num++;
}
count_len++;
}
cout << count_num;
}
#include <string>
using namespace std;
int main()
{
int count_len, count_num;
char input_string[500], selected_letter[500];
count_len = 0;
count_num = 0;
cin .getline (input_string,500);
cin >> selected_letter;
cout << selected_letter[0]<< endl ;
//cout << selected_letter << endl;
while (input_string[count_len] != 0)
{
if ((input_string[count_len] == selected_letter[0])||
(input_string[count_len] == selected_letter[0]+32)||
(input_string[count_len] == selected_letter[0] - 32))
{
count_num++;
}
count_len++;
}
cout << count_num;
}