首页 > 代码库 > [leetcode-409-Longest Palindrome]
[leetcode-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.
思路:
用一个map记录每一个字符出现的次数,偶数次可以直接用来形成回文串,奇数次需要减去1,然后再最后结果上加上1个字符能够形成最长的回文串。
int longestPalindrome(string s) { if(s.size()<=1)return s.size(); map<char,int>mp; for(char ch : s) { mp[ch]++; } int length = 0,odd = 0; for(auto it = mp.begin();it!=mp.end();it++) { if(it->second %2 ==1) { odd = 1; length+= it->second -1 } else length+= it->second ; } length +=odd; return length; }
[leetcode-409-Longest Palindrome]
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。