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

/*扫描一次字符串*/

int FindFirstNoRepeatingChar(char* str)
{
	int iLen, i;
	int apperNum[256] = {0};
	int apperPos[256] = {0};
	int ret;

	iLen = (int)strlen(str);

	ret = iLen;

	memset(apperPos, -1, sizeof(apperPos));

	for (i = 0; i < iLen; ++i)
	{
		if (-1 == apperPos[str[i]])
		{
			apperPos[str[i]] = i;
		}
		apperNum[str[i]] ++;
	}

	for (i = 0; i < 256; ++i)
	{
		if (1 == apperNum[i] && apperPos[i] < ret)
		{
			ret = apperPos[i];
		}
	}

	return str[ret];
}