-
Notifications
You must be signed in to change notification settings - Fork 0
/
Day8_LongestPalindrome.txt
58 lines (43 loc) · 1.16 KB
/
Day8_LongestPalindrome.txt
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
47
48
49
50
51
52
53
54
55
56
57
58
// Given 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 <= 2000
// s consists of lowercase and/or uppercase English letters only.
// Topics
// Hash Table
// String
// Greedy
// Solution:
class Solution {
public:
int longestPalindrome(string s) {
map<char,int> mp;
for(int i=0;i<s.size();i++){
mp[s[i]]++;
}
bool flag=true;
int ans=0;
for(auto it: mp){
if(it.second%2==0){
ans+=it.second;
}
else{
ans+=it.second- 1;
// ans+=1;
flag=false;
}
}
if(!flag){ans+=1;}
return ans;
}
};