Leetcode409.Longest LongestPalindrome

def longestPalindrome(s):
    map_dict = dict()

    for i in s:
        if i in map_dict.keys():
            map_dict+=1
        else:
            map_dict =1

    res = 0
    mark = 0
    for j in map_dict.keys():
        if map_dict[j]%2 ==1:
            mark +=1
        res = map_dict[j]//2

    res = res *2 +1 if mark>0 else res *2

    return res if res>0 else(1 if mark >0 else 0)