bitmap--字符处理

# include<stdio.h>  
# include<string.h>  
  
const int N = 26;  
int bit_map[N];  
  
void findNoRepeat(char *src)  
{  
    int pos;  
    char *str = src;  
    int i ,len = strlen(src);  
      
    //统计  
    for(i = 0 ; i < len ;i ++)  
        bit_map[str[i]-'a'] ++;  
      
    //从字符串开始遍历 其bit_map==1 那么就是结果  
    for(i = 0 ; i < len ; i ++)  
    {  
        if(bit_map[str[i]-'a'] == 1)  
        {  
            printf("%c",str[i]);  
            return ;  
        }  
    }  
}  
  
int main()  
{     
    char *src = "abaccdeff";  
    findNoRepeat(src);  
    printf("/n");  
    return 0;  
}

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