Leetcode #387 First Unique Character in a String
2017-03-09 23:49
316 查看
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
相关文章推荐
- leetcode First Unique Character in a String
- First Unique Character in a String
- 387.leetcode First Unique Character in a String(easy)[统计字符串字符次数]
- leetcode---First Unique Character in a String
- leetcode:First Unique Character in a String
- First Unique Character in a String
- leetcode387:First Unique Character in a String
- Leetcode学习(38)—— First Unique Character in a String
- First Unique Character in a String
- LeetCode(387)First Unique Character in a String
- leetcode 387 First Unique Character in a String C++
- First Unique Character in a String
- LEETCODE--First Unique Character in a String
- LeetCode之First Unique Character in a String
- leetcode 387 First Unique Character in a String
- LeetCode - First Unique Character in a String
- First Unique Character in a String
- Easy 387题 First Unique Character in a String
- LeetCode First Unique Character in a String
- 【python】【leetcode】【算法题目387—First Unique Character in a String】