Longest Palindrome
来源:互联网 发布:程序员培训机构 编辑:程序博客网 时间:2024/05/02 02:33
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 {public: int longestPalindrome(string s) { vector<int> vt(256,0); for(auto& ss:s) vt[ss-'\0']++; int count = 0; bool odd = false; for(auto& i:vt){ count+=i/2*2; if(i%2==1){ odd = true; } } return odd?count+1:count; }};
0 0
- Longest Palindrome
- Longest Palindrome
- Longest Palindrome
- Longest Palindrome
- Longest Palindrome
- Longest Palindrome
- Longest Palindrome
- Longest Palindrome
- uva 11151 Longest Palindrome
- 11151 - Longest Palindrome
- UVa 11151 - Longest Palindrome
- longest Palindrome substring
- UVA 11151 Longest Palindrome
- Uva 11151 - Longest Palindrome
- UVa 11151 - Longest Palindrome
- uva 11151 - Longest Palindrome
- 11151 - Longest Palindrome
- 11151 - Longest Palindrome
- 329. Longest Increasing Path in a Matrix(第七周)
- 引用
- 简单实现四舍五入的好方法
- -日志- Fastjson 总结
- Java多线程详解
- Longest Palindrome
- hibernate之Criteria查询对象
- 多线程之join()方法---(Thread提供的让一个线程等待另一个线程完成的方法)
- Android Studio 进行单元测试完整教程
- 正则表达式
- SpringBoot之——热部署的两种方式
- MySQL查询缓存设置 提高MySQL查询性能
- Android 使用 Usb Accessory 模式与 linux 下位机进行通信
- leetcode 46. Permutations(考全排列)