Leetcode #387 First Unique Character in a String

Description

Given a string, find the first non-repeating character in it and return it’s index. If it doesn’t exist, return -1.

Example

s = “leetcode”
return 0.

s = “loveleetcode”,
return 2.

Note:

  • You may assume the string contain only lowercase letters.

Code

class Solution(object):
    def firstUniqChar(self, s):
        """
        :type s: str
        :rtype: int
        """
        cnt = dict()
        for i in s:
            cnt[i] = cnt.get(i, 0) + 1
        for i,x in enumerate(s):
            if cnt[x] == 1:
                return i
        else:
            return -1
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值