题解 | #找出字符串中第一个只出现一次的字符#

#include <stdio.h>

int main()
{
    char str[1000] = {0};
    char c = '0';
    gets(str);
    int len = strlen(str);
    int array[len];
    memset(array, 0, len*sizeof(int));
    for(int i = 0; i < len; i++)
    {
        c = str[i];
        for(int j = 0; j < len; j++)
        {
            //printf("c = [%c], str[%d] = [%c]\n", c, j, str[j]);
            if(c == str[j])
            {
                array[i]++;
            }
        }
    }
#if 0
    for(int i = 0; i < len; i++)
    {
        printf("array[%d] = [%d]\n", i, array[i]);
    }
#endif
    int flag = 0;
    for(int i = 0; i < len; i++)
    {
        if(array[i] == 1)
        {
            flag++;
            printf("%c\n", str[i]);
            break;
        }
    }
    
    if(flag == 0)
    {
        printf("%d\n", -1);
    }
    return 0;
}

示例一打印： asdfasdfo

array[0] = [2]
array[1] = [2]
array[2] = [2]
array[3] = [2]
array[4] = [2]
array[5] = [2]
array[6] = [2]
array[7] = [2]
array[8] = [1]
o