class Solution {
public:
int firstUniqChar(string s) {
for(int i = 0;i<s.size();i++)
{
int dex = s.find(s[i]);
int reversedex = s.rfind(s[i]);
if(dex == reversedex)
{
return i;
}
}
return -1;
}
};
class Solution {
public:
int firstUniqChar(string s) {
for(int i = 0;i<s.size();i++)
{
int dex = s.find(s[i]);
int reversedex = s.rfind(s[i]);
if(dex == reversedex)
{
return i;
}
}
return -1;
}
};