-
-
Notifications
You must be signed in to change notification settings - Fork 299
/
409.py
45 lines (37 loc) · 1.23 KB
/
409.py
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
__________________________________________________________________________________________________
sample 24 ms submission
class Solution:
def longestPalindrome(self, s: str) -> int:
counter = {}
for c in s:
if c in counter:
counter[c] += 1
else:
counter[c] = 1
has_isolated = False
l = 0
for _, v in counter.items():
if v % 2 == 1:
has_isolated = True
l += v - 1
else:
l += v
if has_isolated:
l += 1
return l
__________________________________________________________________________________________________
sample 13004 kb submission
from collections import defaultdict
class Solution:
def longestPalindrome(self, s: str) -> int:
d = defaultdict(int)
for c in s:
d[c] += 1
count = 0
for v in d.values():
n = v // 2 * 2
count += n
if len(s) > count:
count += 1
return count
__________________________________________________________________________________________________