[LeetCode&Python] Problem 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.

from collections import Counter
class Solution(object):
    def firstUniqChar(self, s):
        """
        :type s: str
        :rtype: int
        """
        m=100000
        a=Counter(s)
        for i in a:
            if a[i]==1:
                ind=s.index(i)
                if m>ind:
                    m=ind
                    
        if m<100000:
            return m
        return -1