找出字符串中只出现一次的第一个字符

#include <iostream>

using namespace std;

char str[] = "abaccdeff";

const int size = 26;
int hashTable[26];

void FindFirstOne(char *str)
{
char* pStr = str;
while(*pStr != '/0') {
hashTable[*pStr - 'a']++;
pStr++;
}
pStr = str;
while(*pStr != '/0') {
if(hashTable[*pStr - 'a'] == 1) {
cout << "first one is: " << *pStr << endl;
break;
}
pStr++;
}
}

void main()
{
FindFirstOne(str);
}

int findFirstChar(const char *array, int len)
{
for (int i = 0; i < size; i++)
hashBuff[i] = 0;

for (int i = 0; i < len; i++)
{
hashBuff[array[i]]++;
}

for (int i = 0; i < len; i++)
{
if (hashBuff[array[i]] == 1)
return i;
}

return -1;
}