-
-
Notifications
You must be signed in to change notification settings - Fork 299
/
409.cpp
71 lines (66 loc) · 1.71 KB
/
409.cpp
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
59
60
61
62
63
64
65
66
67
68
69
70
71
__________________________________________________________________________________________________
sample 4 ms submission
class Solution {
public:
int longestPalindrome(string s) {
unordered_map<char, int> map;
int length = 0;
for (int i = 0; i < s.length(); i++){
map[s[i]]++;
}
for (auto &pair : map){
if (pair.second % 2 == 0){
length += pair.second;
pair.second -= pair.second;
}
else {
length += (pair.second - 1);
pair.second = 1;
}
}
for (auto pair2 : map){
if (pair2.second == 1){
length++;
break;
}
}
return length;
}
};
__________________________________________________________________________________________________
sample 9120 kb submission
class Solution {
public:
int longestPalindrome(string s) {
if(s.size()==0)
{
return 0;
}
int res=0;
array<int,52>t_count{0};
for(auto c:s)
{
if(c>='A'&&c<='Z')
{
t_count[c-'A'+26]++;
}
else
{
t_count[c-'a']++;
}
}
bool flag=true;
for(auto i:t_count)
{
if(flag&&i%2)
{
res++;
flag=false;
}
int temp=i/2;
res+=temp*2;
}
return max(1,res);
}
};
__________________________________________________________________________________________________