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.

题意

给你一个字符串，找出第一个在字符串中不存在重复字符的字符，返回它的下标，不存在的话返回-1.

题解

使用map容器记录每个字符出现的次数。

C++代码

class Solution {
public:
    int firstUniqChar(string s) {

        map<char, int>m;
        for(int i=0; i<s.length(); i++)
        {
            m[s[i]]++;
        }
        for(int i=0; i<s.length(); i++)
        {
            if(m[s[i]] == 1)
                return i;
        }
        return -1;
    }
};

python代码

class Solution(object):
    def firstUniqChar(self, s):
        """
        :type s: str
        :rtype: int
        """
        m = {}
        for i in range(0, len(s)):
            m[s[i]] = 0
        for i in range(0, len(s)):
            m[s[i]] = m[s[i]] + 1
        for i in range(0, len(s)):
            if m[s[i]]==1:
                return i
        return -1