journey

用定长顺序存储结构编写算法，求串S 所含不同字符的总数和每种字符的个数  

#include "stdio.h"

#include "string.h"

#define MAXSIZE 200

main()

{char str[MAXSIZE],a[MAXSIZE];

 int i,j,k,t=1;

 int b[MAXSIZE];

 clrscr();

 printf("Please enter a string:\n");

 scanf("%c",&str[t]);

 while(str[t]!='\n')

 {t++;

  scanf("%c",&str[t]);

 }

 str[0]=t;

 str[t++]=0;

 i=1;

 while(str[i]!=0)

 {a[i]=str[i];

  j=i+1;

  b[i]=1;

  while(str[j]!=0)

  {if(str[i]==str[j])

   {b[i]++;

    for(k=j;str[k]!=0;k++)

      str[k]=str[k+1];

   }

   else j++;

  }

  i++;

 }

 printf("The amount of different char is:%d\n",--i);

 i=1;

 while(a[i]!=0)

 {printf("char '%c':\t %d\n",a[i],b[i]);

  i++;

 }

}