class Solution:
def firstUniqChar(self, s: str) -> str:
# O(n) O(1)
dic = dict()
for c in s:
if c not in dic:
dic[c] = 0
dic[c]+=1
for k,v in dic.items():
if v == 1:
return k
return " "
剑指 Offer 50. 第一个只出现一次的字符 【哈希表】
最新推荐文章于 2021-07-26 15:14:31 发布