【leetcode】387. First Unique Character in a String【E】

最新推荐文章于 2024-09-27 07:30:00 发布

sscssz

最新推荐文章于 2024-09-27 07:30:00 发布

阅读量385

点赞数

分类专栏： Python 算法 leetcode 字符串哈希文章标签： string leetcode leetcode题解 python 哈希表

本文链接：https://blog.csdn.net/sscssz/article/details/52289792

版权

Python 同时被 3 个专栏收录

176 篇文章 0 订阅

订阅专栏

leetcode

175 篇文章 0 订阅

订阅专栏

算法

157 篇文章 0 订阅

订阅专栏

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.

Subscribe to see which companies asked this question

并不难，用一个字典，记录每个字母出现次数。

然后再遍历一遍，如果是1次，那就是结果

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