# 387.First Unique Character in a String

**387.First Unique Character in a String**

难度:Easy

> 给定一个字符串，找到它的第一个不重复的字符，并返回它的索引。如果不存在，则返回 -1。

案例:

```
s = "leetcode"
返回 0.

s = "loveleetcode",
返回 2.
```

注意事项：您可以假定该字符串只包含小写字母。 简单题，代码如下:

```
class Solution {
public:
    int firstUniqChar(string s) {
        unordered_map<char,int> tmp;
        for(auto c: s)
            tmp[c]++;
        for(int i=0;i<s.length();i++)
        {
            if(tmp[s[i]]==1) return i;
        }
        return -1;
        
    }
};
```


---

# Agent Instructions: Querying This Documentation

If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question.

Perform an HTTP GET request on the current page URL with the `ask` query parameter:

```
GET https://dfine.gitbook.io/leetcode/387.first_unique_character_in_a_string.md?ask=<question>
```

The question should be specific, self-contained, and written in natural language.
The response will contain a direct answer to the question and relevant excerpts and sources from the documentation.

Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.