35.第一个只出现一次的字符

标签：hashtable   数组   

char FirstNotRepeatingChar(char* pString)
{
if (pString == NULL)
return ‘\0‘;
const int tableSize = 256;
unsigned int hashTable[tableSize];
for (unsigned int i = 0; i < tableSize; ++i)
hashTable[i] = 0;
char* pHashKey = pString;
while (*(pHashKey) != ‘\0‘)
hashTable[*(pHashKey++)]++；
pHashKey = pString;
while (*pHashKey != ‘\0‘)
{
if (hashtTable[*pHashKey] == 1)
return *pHashKey;
pHashKey++;
}
return ‘\0‘;
}

35.第一个只出现一次的字符

标签：hashtable   数组   

原文地址：http://blog.csdn.net/wangfengfan1/article/details/46831459