409. Longest Palindrome
来源:互联网 发布:涉税软件下载 编辑:程序博客网 时间:2024/06/09 23:03
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:7Explanation:One longest palindrome that can be built is "dccaccd", whose length is 7.
class Solution(object): def longestPalindrome(self, s): """ :type s: str :rtype: int """ ans=odd=0 cnt=collections.Counter(s); for c in cnt: ans+=cnt[c] if cnt[c]%2==1: ans-=1 odd+=1 return ans+(odd>0)
0 0
- 【Leetcode】409. Longest Palindrome
- 409. Longest Palindrome
- 409. Longest Palindrome
- [LeetCode]409. Longest Palindrome
- 409. Longest Palindrome
- 409. Longest Palindrome
- 409. Longest Palindrome
- LeetCode 409. Longest Palindrome
- 409. Longest Palindrome
- [LeetCode]--409. Longest Palindrome
- leetcode 409. Longest Palindrome
- LeetCode 409. Longest Palindrome
- 409. Longest Palindrome
- LeetCode 409. Longest Palindrome
- 409. Longest Palindrome
- 409. Longest Palindrome
- 409. Longest Palindrome
- 409. Longest Palindrome
- python 编码乱码问题(decode,encode)
- 链表插入排序
- 堆与堆排序
- Keras上实现简单线性回归模型
- Dialog Leak 问题
- 409. Longest Palindrome
- Java四种实现多线程方式
- linux算法简单使用说明
- PHP MAMP破解版 安装
- Java判断单链表是否有环的两种实现方法
- Android 开发知识结构图
- 平台的问题,一些简单的反思
- STM32学习笔记-4
- 物联网分布式架构[java实现]支持TCP/MODBUS转TCP