码迷,mamicode.com
首页 > 其他好文 > 详细

387. First Unique Character in a String

时间:2017-06-11 22:16:03      阅读:139      评论:0      收藏:0      [点我收藏+]

标签:else   amp   string   cas   esc   count   problem   turn   sel   

https://leetcode.com/problems/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.

Examples:

s = "leetcode"
return 0.

s = "loveleetcode",
return 2.

 

Note: You may assume the string contain only lowercase letters.

 

class Solution(object):
    def firstUniqChar(self, s):
        """
        :type s: str
        :rtype: int
        """
        count = {}
        for c in s:
            if c in count.keys():
                count[c] += 1
            else:
                count[c] = 1
            

        for i in range(len(s)):
            c = s[i]
            if count[c] == 1:
                return i
        return -1
        

 

387. First Unique Character in a String

标签:else   amp   string   cas   esc   count   problem   turn   sel   

原文地址:http://www.cnblogs.com/prmlab/p/6986516.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!