题目描述
在一个字符串(0<=字符串长度<=10000,全部由字母组成)中找到第一个只出现一次的字符,并返回它的位置, 如果没有则返回 -1(需要区分大小写).
C++
class Solution {
public:
int FirstNotRepeatingChar(string str) {
if (str.size() == 0) return -1;
map<char, int>has; //用哈希解题,这里要用char
int len = str.size();
for (int i = 0; i < len; i++)
{
if (has.count(str[i]))
has[str[i]]++;
else
has[str[i]] = 1;
}
for (int i = 0; i < len; i++) //遍历map
{
if (has[str[i]] == 1)
return i;
}
return -1;
}
};
Python
# -*- coding:utf-8 -*-
class Solution:
def FirstNotRepeatingChar(self, s):
# write code here
slen = len(s)
if (slen == 0):
return -1
dic = {}
for i in range(slen):
if s[i] not in dic:
dic[s[i]] = 1
else:
dic[s[i]] += 1
for i in range(slen):
if dic[s[i]] == 1:
return i
return -1;
与下面这一题的解法类似