#define MAX_CH_CNT (256)
char find_first_not_repeat_char(const char *str)
{
char ret = '\0';
if(str == NULL)
return ret;
int chCnt[MAX_CH_CNT] = {0};
char chStack[MAX_CH_CNT];
memset(chStack,0,MAX_CH_CNT);
int index = 0;
char *ptr = (char *)str;
while(*ptr != '\0')
{
chCnt[*ptr]++;
if(chCnt[*ptr] == 1)
{
chStack[index] = *ptr;
index++;
}
ptr++;
}
int chMaxCnt = index;
index = 0;
while(index < chMaxCnt)
{
if(chCnt[chStack[index]] == 1)
{
ret = chStack[index];
break;
}
index++;
}
return ret;
}
在字符串中找到第一个只出现一次的字符
最新推荐文章于 2023-07-23 22:43:46 发布