华为OJ-字符个数统计

最新推荐文章于 2022-05-11 11:07:35 发布

转载最新推荐文章于 2022-05-11 11:07:35 发布 · 165 阅读

0 ·

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/zaijiefangbeidawang/p/8254235.html

 1 #include <stdio.h>
 2 #include <string.h>
 3 int cha_num(char *buff)
 4 {
 5     int i, j;
 6     int len = strlen(buff);
 7     int count = 0;
 8     int flag = 0;
 9     for(i = 0; i < len; i++)
10     {    
11         flag = 1;
12         if(buff[i] >= 0 && buff[i] <= 127)
13         {
14             for(j = i + 1; j < len; j++)
15             {
16                 if(buff[i] == buff[j])
17                 {
18                     flag = 0;
19                     break;
20                 }
21             }   
22                 if(flag)
23                     count++;
24            
25         }
26     }
27     return count;
28 }
29 
30 int main()
31 {
32     char buff[1000] = {0};
33     scanf("%s", buff);
34     printf("%d\n", cha_num(buff));
35     
36     return 0;
37 }