leetcode刷题记录21

发表于   |   分类于

介绍

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.

思路

字典储存位置和新字母。发现重复就删除，储存到Del中

代码

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
class Solution(object):
    def firstUniqChar(self, s):
        """
        :type s: str
        :rtype: int
        """
        new={}
        Del=''
        for i in range(len(s)):
            if s[i] not in new:
                if s[i] not in Del:
                    new[s[i]]=i
            else:
                del new[s[i]]
                Del=Del+s[i]
        if new=={}:
            return -1
        else:
            return min(new.values())