forked from rubythonode/javascript-problems-and-solutions
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathlongest-palindrome.js
44 lines (40 loc) · 863 Bytes
/
longest-palindrome.js
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
/**
* 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.
*/
/**
* @param {string} s
* @return {number}
*/
const longestPalindrome = s => {
const set = new Set();
let count = 0; // count of pair
for (let c of s) {
if (set.has(c)) {
set.delete(c);
count++; // found a pair
} else {
set.add(c);
}
}
return set.size > 0 ? 2 * count + 1 : 2 * count;
};
export { longestPalindrome };