标签:华为入职练习 华为oj
#include <iostream> #include <string> #include <algorithm> using namespace std; int main() { int chArray[26] ; memset(chArray, 0, 26*sizeof(int)); int N =0; string s; cin>> N; while (N--) { memset(chArray, 0, 26*sizeof(int)); cin>>s; for (int i =0; i < s.size(); ++i) { if (s[i] <= 'Z' && s[i] >= 'A') { s[i] += 'a' - 'A' ;//将大写字符转换为小写 } chArray[s[i] -'a']++; } sort(chArray, chArray +26); int sum =0; for (int i = 25; i >= 0; i--) { sum = sum + chArray[i] *( i+1); } cout<<sum<<endl; } return 0; }
标签:华为入职练习 华为oj
原文地址:http://blog.csdn.net/xiaohanstu/article/details/42367617