给定一个长度不限的字符串，找出该字符串中出现次数最多的字符

 1 str1 = input()
 2 str2 = str1.split(" ")
 3 sensitive = True
 4 if str2[1] == "false":
 5     sensitive = False
 6 maxCount = 0
 7 maxChar = "0"
 8 if sensitive:
 9     for c in str2[0]:
10         tmp = str2[0].count(c)
11         if tmp > maxCount:
12             maxCount = tmp
13             maxChar = c
14 else:
15     lc = str2[0].lower()
16     index = 0;
17     for c in lc:
18         tmp = lc.count(c)
19         if tmp > maxCount:
20             maxCount = tmp
21             maxChar = str2[0][index]
22         index += 1
23 print("%s %d" % (maxChar, maxCount))

 1 #include<iostream>
 2 using namespace std;
 3 
 4 int main()
 5 {
 6     char c[60000] = { 0 };
 7     char s[5] = { 0 };
 8     unsigned int count[52] = { 0 };
 9     char output[52] = { 0 };
10     memset(c, 0, 60000);
11     bool sensitive = true;
12     cin >> c;
13     cin >> s;
14     int i = 0;
15     int index = 0;
16     while ((i < 5) && (s[i] != 0))
17     {
18         if (strcmp(&s[i + 1], "true"))
19         {
20             sensitive = true;
21         }
22         else
23         {
24             sensitive = false;
25         }
26         break;
27 
28         i++;
29     }
30     int j = 0;
31     int max = 0, outputIndex = 0;
32     while ((j < 6000)&&(c[j]!=0))
33     {
34         if (sensitive)
35         {
36             if (90 < c[j])
37             {
38                 index = c[j] - 'A';
39                 count[index]++;
40                 if (output[index] == 0)
41                 {
42                     output[index] = c[j];
43                 }
44                 if (max < count[index])
45                 {
46                     max = count[index];
47                     outputIndex = index;
48                 }
49             }
50             else
51             {
52                 index = c[j] - 'a';
53                 count[index + 26]++;
54                 if (output[index + 26] == 0)
55                 {
56                     output[index + 26] = c[j];
57                 }
58                 if (max < count[index + 26])
59                 {
60                     max = count[index + 26];
61                     outputIndex = index + 26;
62                 }
63             }
64         }
65         else
66         {
67             if (90 < c[j])
68             {
69                 index = c[j] - 'A';
70             }
71             else
72             {
73                 index = c[j] - 'a';
74             }
75             count[index]++;
76             if (output[index] == 0)
77             {
78                 output[index] = c[j];
79             }
80             if (max < count[index])
81             {
82                 max = count[index];
83                 outputIndex = index;
84             }
85         }
86         j++;
87     }
88     cout << output[outputIndex] << " " << max << endl;
89     system("pause");
90     return 0;
91 }