409. Longest Palindrome
class Solution(object):
def longestPalindrome(self, s):
"""
:type s: str
:rtype: int
"""
mydic = {}
for i in s:
mydic[i] = mydic.get(i,0) + 1
res = 0
flag = False
for i in mydic.values():
if i % 2 == 0:
res += i
else:
res += i-1
flag = True
return res+1 if flag else res
D116 409. Longest Palindrome 题目链接 409. Longest Palindrome...
409. Longest Palindrome Given a string which consists of ...
409. Longest Palindrome https://leetcode.com/problems/lon...
https://leetcode.com/problems/longest-palindrome/descript...
Given a string which consists of lowercase or uppercase l...
Longest Palindrome 这题我完全想错了。求最长回文。统计个个字母出现次数。奇数的保留最大的那个。偶...
Given a string which consists of lowercase or uppercase l...
Javascript 优解，用了hash
Given a string which consists of lowercase or uppercase l...
本文标题：409. Longest Palindrome [Easy] 最
本文链接：https://www.haomeiwen.com/subject/wkhuxctx.html
网友评论