C语言Matrix编程题——[Pointers and C-String]D. Liang 7.12 Occurrences of each letter in a string

最新推荐文章于 2020-08-19 15:07:27 发布

Kamenrider Justice

最新推荐文章于 2020-08-19 15:07:27 发布

阅读量841

点赞数

分类专栏： C语言Matrix 文章标签： c语言

本文链接：https://blog.csdn.net/weixin_45534040/article/details/106198881

版权

C语言Matrix 专栏收录该内容

46 篇文章 3 订阅

订阅专栏

[Pointers and C-String]D. Liang 7.12 Occurrences of each letter in a string

Description:

Write a function that counts the occurrences of each letter in a string using the following header:

int * countLetters(const char * const s)

The function returns the counts as an array of 26 elements.
For example, after invoking

int counts[] = countLetters("ABcaB")

counts[0] is 2, counts[1] is 2, and counts[2] is 1.
Write another function to pass the count array in a parameter as follows:

void countLetters(const char * const s, int * counts, int size)

where size is the size of the counts array. In this case, it is 26.

Hint:

Don’t submit the main() function

Programme:

//Date:2020/5/18
//Kamenrider Justice
int * countLetters(const char * const s)//只用写一个函数，题目只是告诉我们还有另一种方法
{
   int length,* count,i;
   count=(int*)malloc(26*sizeof(int));//分配内存
   for(i=0;i<26;i++)//初始化
   {
      count[i]=0;
   }
   length=strlen(s);
   for(i=0;i<length;i++)//区分大小写
   {
      if(islower(s[i]))
      {
         count[s[i]-'a']++;
      }
      if(isupper(s[i]))
      {
         count[s[i]-'A']++;
      }
  
   }
   return count;
}