[Go] simple solution using map
my solution using map.\n\ngo\nfunc longestPalindrome(s string) int {\n    count := make(map[byte]int)\n    for i:=0; i<len(s);i++{\n        ch := s[i]\n        
my solution using map.\n\n```go\nfunc longestPalindrome(s string) int {\n    count := make(map[byte]int)\n    for i:=0; i<len(s);i++{\n        ch := s[i]\n        if _, ok := count[ch]; !ok {\n            count[ch] = 1\n        } else {\n            count[ch] += 1\n        }\n    }\n    \n    ans := 0\n    for _, val := range count {\n        ans += val / 2 * 2\n        if ans % 2 == 0 && val % 2 == 1 {\n            ans += 1\n        }\n    }\n    \n    return ans\n}\n```
['Hash Table', 'Go']