题目:
解题思路:
遍历字符串,每 k 个字符进行一次求和、取余并添加至返回数组的末尾。
char* stringHash(char* s, int k) {
int len =strlen(s);
int n = len / k;
char* str = (char*)malloc(sizeof(char) * (n + 1));
int num = 0;
int sum = 0;
for(int i = 0; i < len; i++){
sum += s[i] - 'a';
if((i + 1) % k == 0){
int hashedChar = sum % 26;
str[num++] = hashedChar + 'a';
sum = 0;
}
}
str[n] = '\0';
return str;
}