lurenaa的博客

😂代码实现

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
class Solution {
public:
int firstUniqChar(string s) {
if(!s.size())
return -1;
map<char, int> st;
for(int i = 0; i < s.size(); ++i){
if(!st.count(s[i])) {
st[s[i]] = i;
} else {
st[s[i]] = INT_MAX;
}
}
if(!st.size())
return -1;
auto x = min_element(st.begin(), st.end(), [](auto& a, auto& b){
if(a.second < b.second) {
return true;
}
return false;
});
if(x->second == INT_MAX)
return -1;
return x->second;
}
};

Accepted

104/104 cases passed (92 ms)

Your runtime beats 20.33 % of cpp submissions

Your memory usage beats 5.07 % of cpp submissions (13.5 MB)