C++計算每個字符出現(xiàn)的次數(shù)
更新時間:2016年05月02日 17:52:18 作者:王勛廣
這篇文章主要介紹了C++計算每個字符出現(xiàn)的次數(shù)的相關資料,需要的朋友可以參考下
本文實例為大家分享了C++計算每個字符出現(xiàn)的次數(shù)的實現(xiàn)代碼,供大家參考,具體內(nèi)容如下
#include <iostream> //#include <cstdlib> #include <ctime> using namespace std; const int NUMBER_OF_LETTERS = 26; const int NUMBER_OF_RANDOM_LETTERS = 100; void createArray(char []); void displayArray(const char []); void countLetters(const char [], int []); void displayCounts(const int []); int main() { char chars[NUMBER_OF_RANDOM_LETTERS]; createArray(chars); cout << "The lowercase letters are:" << endl; displayArray(chars); int counts[NUMBER_OF_LETTERS]; countLetters(chars, counts); cout << "\nThe occurrences of each letter are:" << endl; displayCounts(counts); return 0; } void createArray(char chars[]) { srand((unsigned int)time(0)); for (int i = 0; i < NUMBER_OF_RANDOM_LETTERS; i++) { chars[i] = static_cast<char>('a' + rand() % ('z' - 'a' + 1)); } } void displayArray(const char chars[]) { for (int i = 0; i < NUMBER_OF_RANDOM_LETTERS; i++) { if ((i + 1) % 20 == 0) cout << chars[i] << " " << endl; else cout << chars[i] << " "; } } void countLetters(const char chars[], int counts[]) { for (int i = 0; i < NUMBER_OF_LETTERS; i++) counts[i] = 0; for (int i = 0; i < NUMBER_OF_RANDOM_LETTERS; i++) counts[chars[i] - 'a']++; //經(jīng)典 } void displayCounts(const int counts[]) { for (int i = 0; i < NUMBER_OF_LETTERS; i++) { if ((i + 1) % 10 == 0) cout << counts[i] << " " << static_cast<char>(i + 'a') << endl; else cout << counts[i] << " " << static_cast<char>(i + 'a') << " "; } cout << endl; }
以上就是本文的全部內(nèi)容,希望對大家的學習有所幫助。
相關文章
C++實現(xiàn)十進制數(shù)轉換為二進制數(shù)的數(shù)學算法
這篇文章和大家分享一下我個人對十進制數(shù)轉換為二進制數(shù)的想法,目前暫時更新只整數(shù)十進制的轉換,后續(xù)會更新帶有小數(shù)的進制轉換,代碼使用c++實現(xiàn)2021-09-09