Given a string which consists of lowercase or uppercase letters, find the length of the longest palindromes that can be built with those letters.<\/p>\n
This is case sensitive, for example\u00a0 Note:<\/b> Example:<\/b><\/p>\n Python<\/strong><\/p>\n\"Aa\"<\/code>\u00a0is not considered a palindrome here.<\/p>\n
\nAssume the length of given string will not exceed 1,010.<\/p>\nInput:\r\n\"abccccdd\"\r\n\r\nOutput:\r\n7\r\n\r\nExplanation:\r\nOne longest palindrome that can be built is \"dccaccd\", whose length is 7.<\/pre>\n
\r\nclass Solution:\r\n def longestPalindrome(self, s):\r\n """\r\n :type s: str\r\n :rtype: int\r\n """\r\n result = 0\r\n d = dict()\r\n for i in s:\r\n if i in d:\r\n d[i] = d[i] + 1\r\n if d[i] % 2 == 0:\r\n result += 1\r\n else:\r\n d[i] = 1\r\n result *= 2\r\n if result == 0:\r\n return 1\r\n if result != len(s):\r\n return result + 1\r\n else:\r\n return result\r\n<\/pre>\n","protected":false},"excerpt":{"rendered":"