#-*- coding: UTF-8 -*-
from collections import Counter
class Solution(object):
def longestPalindrome(self, s):
"""
:type s: str
:rtype: int
"""
lopa=0
lopa1=0
slist=list(s)
result=Counter(s)
maxOdd=1
maxKey=None
oddDic={}
for k,v in result.iteritems():
if v%2==0:lopa+=v
else:
oddDic.setdefault(k,v)
if v>=maxOdd:maxOdd=v;maxKey=k
if maxKey!=None:lopa+=maxOdd;oddDic.pop(maxKey)
if oddDic!=None:
for v in oddDic.itervalues():
lopa+=v/2*2
return lopa
sol=Solution()
print sol.longestPalindrome('ccc')
相关文章
- [LeetCode]题解(python):014-Longest Common Prefix
- 【LeetCode】300. Longest Increasing Subsequence 解题报告(Python & C++)
- [LeetCode][Python]Longest Substring Without Repeating Characters
- LeetCode专题-Python实现之第9题:Palindrome Number
- [LeetCode][Python]Palindrome Number
- leetcode:Valid Palindrome【Python版】
- 【LeetCode】214. Shortest Palindrome 解题报告(Python)
- LeetCode 32 Longest Valid Parentheses (C,C++,Java,Python)
- 【LeetCode】522. Longest Uncommon Subsequence II 解题报告(Python)
- 【LeetCode】687. Longest Univalue Path 解题报告(Python & C++)