2022-03-27 20:56:26 +08:00
< p > Given a string < code > s< / code > , < em > find the first non-repeating character in it and return its index< / em > . If it does not exist, return < code > -1< / code > .< / p >
< p > < / p >
2023-12-09 18:42:21 +08:00
< p > < strong class = "example" > Example 1:< / strong > < / p >
2022-03-27 20:56:26 +08:00
< pre > < strong > Input:< / strong > s = "leetcode"
< strong > Output:< / strong > 0
2023-12-09 18:42:21 +08:00
< / pre > < p > < strong class = "example" > Example 2:< / strong > < / p >
2022-03-27 20:56:26 +08:00
< pre > < strong > Input:< / strong > s = "loveleetcode"
< strong > Output:< / strong > 2
2023-12-09 18:42:21 +08:00
< / pre > < p > < strong class = "example" > Example 3:< / strong > < / p >
2022-03-27 20:56:26 +08:00
< pre > < strong > Input:< / strong > s = "aabb"
< strong > Output:< / strong > -1
< / pre >
< p > < / p >
< p > < strong > Constraints:< / strong > < / p >
< ul >
< li > < code > 1 < = s.length < = 10< sup > 5< / sup > < / code > < / li >
< li > < code > s< / code > consists of only lowercase English letters.< / li >
< / ul >