409. Longest Palindrome
Posted bernieloveslife
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了409. Longest Palindrome相关的知识,希望对你有一定的参考价值。
Given a string which consists of lowercase or uppercase letters, find the length of the longest palindromes that can be built with those letters.
This is case sensitive, for example "Aa" is not considered a palindrome here.
Note:
Assume the length of given string will not exceed 1,010.
Example:
Input:
"abccccdd"
Output:
7
Explanation:
One longest palindrome that can be built is "dccaccd", whose length is 7.
class Solution:
def longestPalindrome(self, s):
"""
:type s: str
:rtype: int
"""
dic = {}
for i in s:
if i not in dic:
dic[i] = 1
else:
dic[i] += 1
count = 0
flag = False
for key,value in dic.items():
if value%2==1:
flag = True
if value>2:
count += value-1
else:
count += value
if flag:
count += 1
return count
以上是关于409. Longest Palindrome的主要内容,如果未能解决你的问题,请参考以下文章
LeetCode 409 Longest Palindrome
[leetcode-409-Longest Palindrome]