387. First Unique Character in a String

Given a string, find the first non-repeating character in it and return it's index. If it doesn't exist, return -1.

Examples:

s="leetcode"return0.s="loveleetcode",return2.


Note:You may assume the string contain only lowercase letters.


此题比较简单

代码如下：

classSolution{public:intfirstUniqChar(strings){set<char>myset;if(s.empty()){return-1;}for(inti=0;i<s.size();i++){charc=s[i];intj;if(myset.find(c)!=myset.end()){continue;}for(j=i+1;j<s.size();j++){if(s[j]==s[i]){myset.insert(c);break;}}if(j==s.size()){returni;}}return-1;}};

2016-08-24 23:58:39