时间轴

2025-09-13

init


题目:

利用计数排序思想,空间换时间,复杂度 O(n)


1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
#include <stdbool.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>

bool isVowel(char c) {
if (c == 'a' || c == 'e' || c == 'i' || c == 'o' || c == 'u' || c == 'A' ||
c == 'E' || c == 'I' || c == 'O' || c == 'U') {
return true;
}
return false;
}

int maxFreqSum(char *s) {

int len;
int arr[58];
len = strlen(s);

memset(arr, 0, 58 * sizeof(int));

for (int i = 0; i < len; i++) {
arr[s[i] - 'A']++;
}
int vowel_max = 0;
int consonant_max = 0;
for (int i = 0; i < 58; i++) {

if (isVowel('A' + i) && arr[i] > vowel_max) {
vowel_max = arr[i];
}

if (!isVowel('A' + i) && arr[i] > consonant_max) {
consonant_max = arr[i];
}
}
return vowel_max + consonant_max;
}
int main() {

int n;
n = maxFreqSum("successes");
printf("%d", n);
}