-
Notifications
You must be signed in to change notification settings - Fork 30
/
longest-palindrome.js
46 lines (44 loc) · 1.07 KB
/
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
45
46
// 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}
*/
var longestPalindrome = function(s) {
var hashMap = {};
var result = 0;
var hasSingle = 0;
for (var i = 0, l = s.length; i <= l - 1; ++i) {
if (!hashMap[s[i]]) {
hashMap[s[i]] = 1;
} else {
hashMap[s[i]]++;
}
}
for (var item in hashMap) {
var even = hashMap[item] % 2;
if (even) {
result += hashMap[item] - 1;
hasSingle = 1;
} else {
result += hashMap[item];
}
}
return result + hasSingle;
};