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 (hashTable[*pHashKey] == 1)
{
return *pHashKey;
}
pHashKey++;
}
return '\0';
}
剑指offor面试题35:第一次只出现一次的字符
最新推荐文章于 2024-08-25 17:50:36 发布