Files
PS/leetcode/387.py
Gyubin Han dede0dca01 leetcode
2025-02-19 14:09:55 +09:00

16 lines
306 B
Python

class Solution:
def firstUniqChar(self, s: str) -> int:
d={}
for i in range(len(s)):
if s[i] in d:
d[s[i]]=-1
else:
d[s[i]]=i
for i in d.values():
if i>-1:
return i
return -1