387. First Unique Character in a String

class Solution {
public:
int firstUniqChar(string s) {
int idx = s.size();
map<int, pair<int, int>> mp;
for (int i = 0; i < s.size();i++) {
mp[s[i]].first++;
mp[s[i]].second = i;
}
for (auto &a : mp) {
if (a.second.first == 1) idx=min(a.second.second,idx);
}
return idx == s.size() ? - 1:idx;

}
};

/*

// not make sure that count(key)==1 is the first uniqchar in s
// maybe multiset can not make the input order ,and so as unordered_multiset
char ch;
        unordered_multiset<char> mt;
        for(char c :s){
            mt.insert(c);
        }
        for(char c:mt){
            if(mt.count(c) == 1){
                ch = c; break;
            }
        }
        return s.find_first_of(ch);
*/
/*


//Error! "cc" -1 but output 1
class Solution {
public:
    int firstUniqChar(string s) {        
        for(int i = 0; i<s.size();i++){
           if (s.rfind(s[i]) == i) return i;
        } 
        return -1;
    }
};
*/

阅读更多
个人分类: 亚马逊 Leecode
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

不良信息举报

387. First Unique Character in a String

最多只允许输入30个字

加入CSDN,享受更精准的内容推荐,与500万程序员共同成长!
关闭
关闭