https://leetcode-cn.com/problems/di-yi-ge-zhi-chu-xian-yi-ci-de-zi-fu-lcof/
简单方法:map+ 两次遍历
func firstUniqChar(s string) byte {
dupMap := make(map[byte]bool, 0)
for i := 0; i < len(s); i++ {
if _, ok := dupMap[s[i]]; !ok {
dupMap[s[i]] = false
} else {
dupMap[s[i]] = true
}
}
for i := 0; i < len(s); i++ {
if v, ok := dupMap[s[i]]; ok {
if !v {
return s[i]
}
}
}
return ' '
}