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" return 0. s = "loveleetcode", return 2.
Note: You may assume the string contain only lowercase letters.
此题比较简单
代码如下：
class Solution {
public:
int firstUniqChar(string s) {
set<char > myset;
if (s.empty())
{
return -1;
}
for(int i = 0 ; i < s.size();i++)
{
char c = s[i];
int j;
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() )
{
return i;
}
}
return -1;
}
};2016-08-24 23:58:39
免责声明：本站发布的内容（图片、视频和文字）以原创、转载和分享为主，文章观点不代表本网站立场，如果涉及侵权请联系站长邮箱：is@yisu.com进行举报，并提供相关证据，一经查实，将立刻删除涉嫌侵权内容。
