Longest Palindrome
Difficulty: EasyTopic: Hash TableStringGreedyLeetcode:409.Longest PalindromeGiven a string s which consists of lowercase or uppercase letters, return the length of the longest palindrome that can be built with those letters.
Letters are case sensitive, for example, "Aa" is not considered a palindrome.
Example 1:
Input: s = "abccccdd"
Output: 7
Explanation: One longest palindrome that can be built is "dccaccd", whose length is 7.
Example 2:
Input: s = "a"
Output: 1
Explanation: The longest palindrome that can be built is "a", whose length is 1.
Constraints:
1 <= s.length <= 2000sconsists of lowercase and/or uppercase English letters only.
Solution
write solution in here
/**
* @param {string} s
* @return {number}
*/
var longestPalindrome = function (s) {
let cache = new Map(), res = 0
for (const char of s) {
if (cache.has(char)) {
cache.delete(char)
res += 2
} else {
cache.set(char)
}
}
return cache.size > 0 ? res + 1 : res;
};