找出字符串中第一个出现次数最多的字符

<pre name="code" class="cpp">#include "OJ.h"
#include <iostream>
using namespace std;
/*
功能: 找出字符串中第一个出现次数最多的字符
    
输入: char* pInputString：字符串
    
输出: char* pChar：出现次数最多的字符
     
返回: false 异常失败
	  true  输出成功
*/

bool FindChar(char* pInputString, char* pChar)
{
	//在这里实现功能
	int symbol[256] ;
	for (int i =0; i < 256; ++i)
	{
		symbol[i] =0;
	}
	if (pInputString == NULL)
	{
		return false;
	}
	if (pChar == NULL)
	{
		return false;
	}
	char *pCur = pInputString;
	int maxNum =0;
	while(*pCur != '\0')
	{
		symbol[*pCur] ++;
		pCur++;
	}
	for (int i =0; i < 255; ++i)
	{
		if (symbol[i] > maxNum)
		{
			maxNum = symbol[i];
		}
	}
	pCur = pInputString;
	while (*pCur != '\0')
	{
		if (symbol[*pCur] == maxNum)
		{
			*pChar = *pCur;
			return true;
		}
		pCur++;
	}
	
}

int main()
{
	char acIutput[] = "aabbccddeee";
	char cResult = 'a';
	char cOutput;
	bool bReturn;

	bReturn = FindChar(acIutput, &cOutput);
	cout<<(true == bReturn)<<endl;
	cout<<(cResult == cOutput)<<endl;

	return 0;
}