python
暴力遍历字符串+哈希表排序
class Solution:
def firstUniqChar(self, s: str):
if not s:
return ' '
hashtable = dict()
for index, c in enumerate(s):
if c not in hashtable.keys():
hashtable[c] = [index, 1]
else:
hashtable[c][1] += 1
hashtable = sorted(hashtable.values(), key=lambda kv:(kv[1], kv[0]))
res = hashtable[0][0]
count = hashtable[0][1]
return s[res] if count == 1 else ' '