TheAlgorithms-C/leetcode/src/387.c
2019-08-13 11:38:41 -07:00

12 lines
260 B
C

int firstUniqChar(char * s){
int *arr = calloc(256, sizeof(int));
int i;
for(i = 0; i < strlen(s); i++)
arr[s[i]] = arr[s[i]] + 1;
for(i = 0; i < strlen(s); i++) {
if(arr[s[i]] == 1)
return i;
}
return -1;
}