学步园

 /************************************************************************<br /> ***By : summon ***<br /> ***Date : 2010.01.21 ***<br /> ***Function : 求一个字符串中每个字符出现的次数 ***<br /> ***Method1 : 把这个字符串用快速排序处理，处理完后相同的字符全部临接 ***<br /> ***Method2 : 用空间换时间，首先声明一个静态数组count[128]，每个字符 ***<br /> *** ch出现一次就把count[ch]++。 ***<br /> /************************************************************************/<br /> #include <stdlib.h><br /> #include <stdio.h><br /> #include <string.h><br /> #include <iostream.h></p> <p>//////////////////////////Method1////////////////////////////////////////<br /> #define MAXLEN 128<br /> typedef int STATUS;<br /> typedef struct _Result<br /> {<br /> char ch;<br /> unsigned int times;<br /> }Result;<br /> typedef struct _Node<br /> {<br /> Result res;<br /> _Node *next;<br /> }Node;<br /> typedef struct _Linker<br /> {<br /> Node *head;<br /> int length;<br /> }Linker;</p> <p>STATUS InputString(char *&InputData);<br /> STATUS QSortString(char *InputData);<br /> STATUS Method1(char *InputData, Linker *&lin);<br /> STATUS OutputResult(Linker *lin);<br /> int cmpCHAR(const void *a, const void *b);<br /> ////////////////////////////////////////////////////////////////////////</p> <p>//////////////////////////Method2///////////////////////////////////////<br /> static unsigned int count[128];<br /> STATUS InputString2(char *&InputData);<br /> STATUS Method2(char *InputData);<br /> STATUS OutputResult2();<br /> ////////////////////////////////////////////////////////////////////////</p> <p>int main(int argc, char* argv[])<br /> {<br /> int ret = -1;<br /> char *InputData;<br /> Linker *lin;</p> <p> ret = InputString(InputData);<br /> ret = QSortString(InputData);<br /> ret = Method1(InputData, lin);<br /> ret = OutputResult(lin);</p> <p> ret = InputString2(InputData);<br /> ret = Method2(InputData);<br /> ret = OutputResult2();</p> <p> return 0;<br /> }</p> <p>int cmpCHAR(const void *a, const void *b)<br /> {<br /> return *(char *)a - *(char *)b;<br /> }</p> <p>STATUS InputString(char *&InputData)<br /> {<br /> char temp[100];<br /> memset(temp, 0, 100);<br /> printf("Please input a string!/n");<br /> fflush(stdin);<br /> cin.getline(temp, 100);<br /> int len = strlen(temp);<br /> InputData = (char *)malloc(sizeof(char)*(len + 1));<br /> memcpy(InputData, temp, len);<br /> InputData[len] = '/0';<br /> return 1;<br /> }</p> <p>STATUS QSortString(char *InputData)<br /> {<br /> if (InputData == NULL)<br /> {<br /> return 0;<br /> }</p> <p> int len = strlen(InputData);<br /> qsort(InputData, len, sizeof(char), cmpCHAR);<br /> return 1;<br /> }</p> <p>STATUS Method1(char *InputData, Linker *&lin)<br /> {<br /> if (InputData == NULL)<br /> {<br /> return 0;<br /> }</p> <p> lin = (Linker *)malloc(sizeof(Linker));<br /> lin->head = NULL;<br /> lin->length = 0;</p> <p> Node *temp = (Node *)malloc(sizeof(Node));<br /> lin->head = temp;<br /> lin->head->res.ch = InputData[0];<br /> lin->head->res.times = 1;<br /> lin->head->next = NULL;<br /> lin->length += 1;</p> <p> int len = strlen(InputData);<br /> for (int i=1; i<len; i++)<br /> {<br /> if (InputData[i-1] == InputData[i])<br /> {<br /> temp->res.times += 1;<br /> }else<br /> {<br /> Node *temp2 = (Node *)malloc(sizeof(Node));<br /> temp->next = temp2;<br /> temp2->res.ch = InputData[i];<br /> temp2->res.times = 1;<br /> temp2->next = NULL;</p> <p> temp = temp2;<br /> }<br /> }<br /> return 1;<br /> }</p> <p>STATUS OutputResult(Linker *lin)<br /> {<br /> if (lin == NULL)<br /> {<br /> return 0;<br /> }</p> <p> Node *temp = lin->head;<br /> while (temp->next != NULL)<br /> {<br /> printf("Charector :%c, Times: %d/n", temp->res.ch, temp->res.times);<br /> temp = temp->next;<br /> }<br /> printf("Charector :%c, Times: %d/n", temp->res.ch, temp->res.times);<br /> return 1;<br /> }</p> <p>STATUS InputString2(char *&InputData)<br /> {<br /> return InputString(InputData);<br /> }</p> <p>STATUS Method2(char *InputData)<br /> {<br /> if (InputData == NULL)<br /> {<br /> return 0;<br /> }</p> <p> for (int j=0; j<128; j++)<br /> {<br /> count[j] = 0;<br /> }</p> <p> int len = strlen(InputData);<br /> for (int i=0; i<len; i++)<br /> {<br /> count[InputData[i]]++;<br /> }<br /> return 1;<br /> }</p> <p>STATUS OutputResult2()<br /> {<br /> for (int i=0; i<128; i++)<br /> {<br /> if (count[i] != 0)<br /> {<br /> printf("Charector: %c, Times: %d/n", i, count[i]);<br /> }else<br /> {<br /> continue;<br /> }<br /> }<br /> return 1;<br /> }